./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--usb--cx82310_eth.ko-entry_point.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.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--usb--cx82310_eth.ko-entry_point.cil.out.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 4e983f35cff7a0c67962e23f6c3d66292f25c728e4d1df204c975f306d1512a3 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-173e394 [2021-11-06 14:42:24,684 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-06 14:42:24,686 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-06 14:42:24,720 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-06 14:42:24,721 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-06 14:42:24,723 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-06 14:42:24,724 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-06 14:42:24,726 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-06 14:42:24,727 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-06 14:42:24,730 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-06 14:42:24,731 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-06 14:42:24,732 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-06 14:42:24,732 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-06 14:42:24,734 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-06 14:42:24,735 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-06 14:42:24,739 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-06 14:42:24,740 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-06 14:42:24,741 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-06 14:42:24,742 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-06 14:42:24,746 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-06 14:42:24,747 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-06 14:42:24,748 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-06 14:42:24,749 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-06 14:42:24,749 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-06 14:42:24,754 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-06 14:42:24,754 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-06 14:42:24,754 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-06 14:42:24,756 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-06 14:42:24,756 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-06 14:42:24,756 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-06 14:42:24,757 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-06 14:42:24,757 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-06 14:42:24,758 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-06 14:42:24,759 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-06 14:42:24,760 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-06 14:42:24,760 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-06 14:42:24,761 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-06 14:42:24,761 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-06 14:42:24,761 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-06 14:42:24,762 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-06 14:42:24,762 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-06 14:42:24,764 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-06 14:42:24,787 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-06 14:42:24,787 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-06 14:42:24,787 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-06 14:42:24,788 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-06 14:42:24,788 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-06 14:42:24,789 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-06 14:42:24,789 INFO L138 SettingsManager]: * Use SBE=true [2021-11-06 14:42:24,789 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-06 14:42:24,789 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-06 14:42:24,789 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-06 14:42:24,790 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-06 14:42:24,790 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-06 14:42:24,790 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-06 14:42:24,790 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-06 14:42:24,790 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-06 14:42:24,790 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-06 14:42:24,791 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-06 14:42:24,791 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-06 14:42:24,791 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-06 14:42:24,791 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-06 14:42:24,791 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-06 14:42:24,791 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-06 14:42:24,791 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-06 14:42:24,792 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-06 14:42:24,792 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-06 14:42:24,792 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-06 14:42:24,792 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-06 14:42:24,792 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-06 14:42:24,792 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-06 14:42:24,792 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 -> 4e983f35cff7a0c67962e23f6c3d66292f25c728e4d1df204c975f306d1512a3 [2021-11-06 14:42:24,992 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-06 14:42:25,013 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-06 14:42:25,015 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-06 14:42:25,016 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-06 14:42:25,017 INFO L275 PluginConnector]: CDTParser initialized [2021-11-06 14:42:25,017 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--usb--cx82310_eth.ko-entry_point.cil.out.i [2021-11-06 14:42:25,075 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2448308e/d2eec28b22c044e4a6982643e1533cc1/FLAG7ad6017bb [2021-11-06 14:42:25,626 INFO L306 CDTParser]: Found 1 translation units. [2021-11-06 14:42:25,626 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--usb--cx82310_eth.ko-entry_point.cil.out.i [2021-11-06 14:42:25,661 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2448308e/d2eec28b22c044e4a6982643e1533cc1/FLAG7ad6017bb [2021-11-06 14:42:26,095 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2448308e/d2eec28b22c044e4a6982643e1533cc1 [2021-11-06 14:42:26,097 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-06 14:42:26,098 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-06 14:42:26,101 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-06 14:42:26,101 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-06 14:42:26,103 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-06 14:42:26,104 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 02:42:26" (1/1) ... [2021-11-06 14:42:26,105 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43669b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 02:42:26, skipping insertion in model container [2021-11-06 14:42:26,105 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 02:42:26" (1/1) ... [2021-11-06 14:42:26,110 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-06 14:42:26,180 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-06 14:42:26,674 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--usb--cx82310_eth.ko-entry_point.cil.out.i[159401,159414] [2021-11-06 14:42:26,857 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-06 14:42:26,877 INFO L203 MainTranslator]: Completed pre-run [2021-11-06 14:42:26,990 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--usb--cx82310_eth.ko-entry_point.cil.out.i[159401,159414] [2021-11-06 14:42:27,053 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-06 14:42:27,080 INFO L208 MainTranslator]: Completed translation [2021-11-06 14:42:27,081 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 02:42:27 WrapperNode [2021-11-06 14:42:27,081 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-06 14:42:27,083 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-06 14:42:27,083 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-06 14:42:27,083 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-06 14:42:27,088 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 02:42:27" (1/1) ... [2021-11-06 14:42:27,123 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 02:42:27" (1/1) ... [2021-11-06 14:42:27,206 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-06 14:42:27,208 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-06 14:42:27,208 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-06 14:42:27,208 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-06 14:42:27,215 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 02:42:27" (1/1) ... [2021-11-06 14:42:27,215 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 02:42:27" (1/1) ... [2021-11-06 14:42:27,228 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 02:42:27" (1/1) ... [2021-11-06 14:42:27,228 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 02:42:27" (1/1) ... [2021-11-06 14:42:27,310 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 02:42:27" (1/1) ... [2021-11-06 14:42:27,321 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 02:42:27" (1/1) ... [2021-11-06 14:42:27,344 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 02:42:27" (1/1) ... [2021-11-06 14:42:27,356 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-06 14:42:27,357 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-06 14:42:27,357 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-06 14:42:27,357 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-06 14:42:27,373 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 02:42:27" (1/1) ... [2021-11-06 14:42:27,378 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-06 14:42:27,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 14:42:27,394 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 14:42:27,396 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 14:42:27,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2021-11-06 14:42:27,417 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2021-11-06 14:42:27,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2021-11-06 14:42:27,418 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-06 14:42:27,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-06 14:42:27,418 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-06 14:42:27,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-06 14:42:27,418 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-06 14:42:27,418 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-06 14:42:27,418 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-06 14:42:27,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-06 14:42:27,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-06 14:42:27,419 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2021-11-06 14:42:27,419 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-06 14:42:27,419 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-06 14:42:29,628 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-06 14:42:29,630 INFO L299 CfgBuilder]: Removed 377 assume(true) statements. [2021-11-06 14:42:29,631 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 02:42:29 BoogieIcfgContainer [2021-11-06 14:42:29,632 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-06 14:42:29,633 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-06 14:42:29,633 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-06 14:42:29,635 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-06 14:42:29,636 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 02:42:26" (1/3) ... [2021-11-06 14:42:29,636 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@772e4afa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 02:42:29, skipping insertion in model container [2021-11-06 14:42:29,636 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 02:42:27" (2/3) ... [2021-11-06 14:42:29,636 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@772e4afa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 02:42:29, skipping insertion in model container [2021-11-06 14:42:29,637 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 02:42:29" (3/3) ... [2021-11-06 14:42:29,637 INFO L111 eAbstractionObserver]: Analyzing ICFG 205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--usb--cx82310_eth.ko-entry_point.cil.out.i [2021-11-06 14:42:29,641 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-06 14:42:29,641 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-06 14:42:29,679 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-06 14:42:29,683 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 14:42:29,683 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-06 14:42:29,710 INFO L276 IsEmpty]: Start isEmpty. Operand has 449 states, 447 states have (on average 1.5100671140939597) internal successors, (675), 448 states have internal predecessors, (675), 0 states have call successors, (0), 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 14:42:29,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-11-06 14:42:29,717 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 14:42:29,717 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] [2021-11-06 14:42:29,717 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 14:42:29,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 14:42:29,721 INFO L85 PathProgramCache]: Analyzing trace with hash 1795372011, now seen corresponding path program 1 times [2021-11-06 14:42:29,727 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 14:42:29,727 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196362761] [2021-11-06 14:42:29,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 14:42:29,728 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 14:42:29,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 14:42:30,056 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 14:42:30,056 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 14:42:30,057 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196362761] [2021-11-06 14:42:30,057 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196362761] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 14:42:30,057 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 14:42:30,057 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 14:42:30,059 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346584996] [2021-11-06 14:42:30,062 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 14:42:30,062 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 14:42:30,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 14:42:30,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 14:42:30,076 INFO L87 Difference]: Start difference. First operand has 449 states, 447 states have (on average 1.5100671140939597) internal successors, (675), 448 states have internal predecessors, (675), 0 states have call successors, (0), 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 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 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 14:42:30,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 14:42:30,338 INFO L93 Difference]: Finished difference Result 1294 states and 1957 transitions. [2021-11-06 14:42:30,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 14:42:30,340 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-11-06 14:42:30,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 14:42:30,357 INFO L225 Difference]: With dead ends: 1294 [2021-11-06 14:42:30,358 INFO L226 Difference]: Without dead ends: 838 [2021-11-06 14:42:30,365 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 14:42:30,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2021-11-06 14:42:30,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 838. [2021-11-06 14:42:30,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 838 states, 837 states have (on average 1.4289127837514934) internal successors, (1196), 837 states have internal predecessors, (1196), 0 states have call successors, (0), 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 14:42:30,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1196 transitions. [2021-11-06 14:42:30,444 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1196 transitions. Word has length 21 [2021-11-06 14:42:30,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 14:42:30,445 INFO L470 AbstractCegarLoop]: Abstraction has 838 states and 1196 transitions. [2021-11-06 14:42:30,445 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 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 14:42:30,445 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1196 transitions. [2021-11-06 14:42:30,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-06 14:42:30,450 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 14:42:30,451 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] [2021-11-06 14:42:30,451 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-06 14:42:30,451 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 14:42:30,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 14:42:30,453 INFO L85 PathProgramCache]: Analyzing trace with hash 1377357218, now seen corresponding path program 1 times [2021-11-06 14:42:30,453 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 14:42:30,456 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989977385] [2021-11-06 14:42:30,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 14:42:30,456 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 14:42:30,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 14:42:30,592 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 14:42:30,593 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 14:42:30,593 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989977385] [2021-11-06 14:42:30,593 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989977385] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 14:42:30,593 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 14:42:30,594 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-06 14:42:30,594 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127699457] [2021-11-06 14:42:30,595 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 14:42:30,595 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 14:42:30,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 14:42:30,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-06 14:42:30,596 INFO L87 Difference]: Start difference. First operand 838 states and 1196 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 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 14:42:30,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 14:42:30,703 INFO L93 Difference]: Finished difference Result 2488 states and 3557 transitions. [2021-11-06 14:42:30,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 14:42:30,704 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2021-11-06 14:42:30,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 14:42:30,708 INFO L225 Difference]: With dead ends: 2488 [2021-11-06 14:42:30,709 INFO L226 Difference]: Without dead ends: 1657 [2021-11-06 14:42:30,710 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 14:42:30,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1657 states. [2021-11-06 14:42:30,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1657 to 1657. [2021-11-06 14:42:30,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1657 states, 1656 states have (on average 1.4251207729468598) internal successors, (2360), 1656 states have internal predecessors, (2360), 0 states have call successors, (0), 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 14:42:30,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1657 states to 1657 states and 2360 transitions. [2021-11-06 14:42:30,734 INFO L78 Accepts]: Start accepts. Automaton has 1657 states and 2360 transitions. Word has length 28 [2021-11-06 14:42:30,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 14:42:30,734 INFO L470 AbstractCegarLoop]: Abstraction has 1657 states and 2360 transitions. [2021-11-06 14:42:30,734 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 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 14:42:30,734 INFO L276 IsEmpty]: Start isEmpty. Operand 1657 states and 2360 transitions. [2021-11-06 14:42:30,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-11-06 14:42:30,736 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 14:42:30,736 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] [2021-11-06 14:42:30,737 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-06 14:42:30,737 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 14:42:30,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 14:42:30,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1834683196, now seen corresponding path program 1 times [2021-11-06 14:42:30,737 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 14:42:30,738 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580739471] [2021-11-06 14:42:30,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 14:42:30,738 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 14:42:30,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 14:42:30,788 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 14:42:30,788 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 14:42:30,789 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580739471] [2021-11-06 14:42:30,789 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580739471] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 14:42:30,789 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 14:42:30,789 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 14:42:30,789 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348996118] [2021-11-06 14:42:30,790 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 14:42:30,790 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 14:42:30,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 14:42:30,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 14:42:30,791 INFO L87 Difference]: Start difference. First operand 1657 states and 2360 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 14:42:30,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 14:42:30,867 INFO L93 Difference]: Finished difference Result 3483 states and 4983 transitions. [2021-11-06 14:42:30,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 14:42:30,868 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2021-11-06 14:42:30,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 14:42:30,873 INFO L225 Difference]: With dead ends: 3483 [2021-11-06 14:42:30,873 INFO L226 Difference]: Without dead ends: 1838 [2021-11-06 14:42:30,875 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 14:42:30,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2021-11-06 14:42:30,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1831. [2021-11-06 14:42:30,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1831 states, 1830 states have (on average 1.4360655737704917) internal successors, (2628), 1830 states have internal predecessors, (2628), 0 states have call successors, (0), 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 14:42:30,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1831 states to 1831 states and 2628 transitions. [2021-11-06 14:42:30,905 INFO L78 Accepts]: Start accepts. Automaton has 1831 states and 2628 transitions. Word has length 50 [2021-11-06 14:42:30,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 14:42:30,905 INFO L470 AbstractCegarLoop]: Abstraction has 1831 states and 2628 transitions. [2021-11-06 14:42:30,905 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 14:42:30,905 INFO L276 IsEmpty]: Start isEmpty. Operand 1831 states and 2628 transitions. [2021-11-06 14:42:30,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-11-06 14:42:30,909 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 14:42:30,909 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 14:42:30,909 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-06 14:42:30,909 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 14:42:30,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 14:42:30,910 INFO L85 PathProgramCache]: Analyzing trace with hash 1294035092, now seen corresponding path program 1 times [2021-11-06 14:42:30,910 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 14:42:30,910 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383763173] [2021-11-06 14:42:30,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 14:42:30,910 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 14:42:30,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 14:42:31,007 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 14:42:31,007 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 14:42:31,008 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383763173] [2021-11-06 14:42:31,008 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383763173] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 14:42:31,008 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 14:42:31,008 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 14:42:31,009 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714591395] [2021-11-06 14:42:31,009 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 14:42:31,009 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 14:42:31,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 14:42:31,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 14:42:31,013 INFO L87 Difference]: Start difference. First operand 1831 states and 2628 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 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 14:42:31,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 14:42:31,279 INFO L93 Difference]: Finished difference Result 3879 states and 5607 transitions. [2021-11-06 14:42:31,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 14:42:31,279 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2021-11-06 14:42:31,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 14:42:31,285 INFO L225 Difference]: With dead ends: 3879 [2021-11-06 14:42:31,285 INFO L226 Difference]: Without dead ends: 2060 [2021-11-06 14:42:31,287 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 14:42:31,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2060 states. [2021-11-06 14:42:31,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2060 to 2053. [2021-11-06 14:42:31,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2053 states, 2052 states have (on average 1.442495126705653) internal successors, (2960), 2052 states have internal predecessors, (2960), 0 states have call successors, (0), 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 14:42:31,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2053 states to 2053 states and 2960 transitions. [2021-11-06 14:42:31,319 INFO L78 Accepts]: Start accepts. Automaton has 2053 states and 2960 transitions. Word has length 64 [2021-11-06 14:42:31,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 14:42:31,320 INFO L470 AbstractCegarLoop]: Abstraction has 2053 states and 2960 transitions. [2021-11-06 14:42:31,321 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 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 14:42:31,322 INFO L276 IsEmpty]: Start isEmpty. Operand 2053 states and 2960 transitions. [2021-11-06 14:42:31,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-11-06 14:42:31,323 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 14:42:31,323 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 14:42:31,323 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-06 14:42:31,323 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 14:42:31,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 14:42:31,324 INFO L85 PathProgramCache]: Analyzing trace with hash 45757330, now seen corresponding path program 1 times [2021-11-06 14:42:31,324 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 14:42:31,325 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509052545] [2021-11-06 14:42:31,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 14:42:31,325 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 14:42:31,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 14:42:31,428 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-06 14:42:31,428 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 14:42:31,428 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509052545] [2021-11-06 14:42:31,428 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509052545] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 14:42:31,428 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 14:42:31,429 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 14:42:31,429 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236069769] [2021-11-06 14:42:31,429 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 14:42:31,429 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 14:42:31,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 14:42:31,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 14:42:31,430 INFO L87 Difference]: Start difference. First operand 2053 states and 2960 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 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 14:42:31,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 14:42:31,632 INFO L93 Difference]: Finished difference Result 9247 states and 13428 transitions. [2021-11-06 14:42:31,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 14:42:31,633 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 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 64 [2021-11-06 14:42:31,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 14:42:31,655 INFO L225 Difference]: With dead ends: 9247 [2021-11-06 14:42:31,655 INFO L226 Difference]: Without dead ends: 7206 [2021-11-06 14:42:31,660 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 14:42:31,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7206 states. [2021-11-06 14:42:31,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7206 to 2085. [2021-11-06 14:42:31,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2085 states, 2084 states have (on average 1.435700575815739) internal successors, (2992), 2084 states have internal predecessors, (2992), 0 states have call successors, (0), 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 14:42:31,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2085 states to 2085 states and 2992 transitions. [2021-11-06 14:42:31,768 INFO L78 Accepts]: Start accepts. Automaton has 2085 states and 2992 transitions. Word has length 64 [2021-11-06 14:42:31,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 14:42:31,769 INFO L470 AbstractCegarLoop]: Abstraction has 2085 states and 2992 transitions. [2021-11-06 14:42:31,769 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 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 14:42:31,769 INFO L276 IsEmpty]: Start isEmpty. Operand 2085 states and 2992 transitions. [2021-11-06 14:42:31,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-11-06 14:42:31,771 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 14:42:31,771 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 14:42:31,771 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-06 14:42:31,771 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 14:42:31,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 14:42:31,771 INFO L85 PathProgramCache]: Analyzing trace with hash 2089538442, now seen corresponding path program 1 times [2021-11-06 14:42:31,772 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 14:42:31,772 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717379581] [2021-11-06 14:42:31,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 14:42:31,772 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 14:42:31,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 14:42:31,855 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-06 14:42:31,856 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 14:42:31,856 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717379581] [2021-11-06 14:42:31,856 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717379581] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 14:42:31,856 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 14:42:31,856 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-06 14:42:31,857 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793098261] [2021-11-06 14:42:31,857 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-06 14:42:31,857 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 14:42:31,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-06 14:42:31,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-11-06 14:42:31,858 INFO L87 Difference]: Start difference. First operand 2085 states and 2992 transitions. Second operand has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 9 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 14:42:32,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 14:42:32,581 INFO L93 Difference]: Finished difference Result 10761 states and 15626 transitions. [2021-11-06 14:42:32,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-06 14:42:32,582 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 9 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 67 [2021-11-06 14:42:32,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 14:42:32,606 INFO L225 Difference]: With dead ends: 10761 [2021-11-06 14:42:32,607 INFO L226 Difference]: Without dead ends: 8688 [2021-11-06 14:42:32,612 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2021-11-06 14:42:32,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8688 states. [2021-11-06 14:42:32,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8688 to 2117. [2021-11-06 14:42:32,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2117 states, 2116 states have (on average 1.4291115311909264) internal successors, (3024), 2116 states have internal predecessors, (3024), 0 states have call successors, (0), 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 14:42:32,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2117 states to 2117 states and 3024 transitions. [2021-11-06 14:42:32,736 INFO L78 Accepts]: Start accepts. Automaton has 2117 states and 3024 transitions. Word has length 67 [2021-11-06 14:42:32,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 14:42:32,736 INFO L470 AbstractCegarLoop]: Abstraction has 2117 states and 3024 transitions. [2021-11-06 14:42:32,736 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 9 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 14:42:32,737 INFO L276 IsEmpty]: Start isEmpty. Operand 2117 states and 3024 transitions. [2021-11-06 14:42:32,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-11-06 14:42:32,738 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 14:42:32,738 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 14:42:32,738 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-06 14:42:32,738 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 14:42:32,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 14:42:32,739 INFO L85 PathProgramCache]: Analyzing trace with hash -536003665, now seen corresponding path program 1 times [2021-11-06 14:42:32,739 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 14:42:32,739 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708520224] [2021-11-06 14:42:32,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 14:42:32,739 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 14:42:32,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 14:42:32,819 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-11-06 14:42:32,819 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 14:42:32,819 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708520224] [2021-11-06 14:42:32,819 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708520224] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 14:42:32,819 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 14:42:32,820 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 14:42:32,820 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153026732] [2021-11-06 14:42:32,820 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 14:42:32,820 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 14:42:32,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 14:42:32,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 14:42:32,821 INFO L87 Difference]: Start difference. First operand 2117 states and 3024 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 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 14:42:32,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 14:42:32,899 INFO L93 Difference]: Finished difference Result 4227 states and 6041 transitions. [2021-11-06 14:42:32,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 14:42:32,899 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 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 69 [2021-11-06 14:42:32,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 14:42:32,905 INFO L225 Difference]: With dead ends: 4227 [2021-11-06 14:42:32,905 INFO L226 Difference]: Without dead ends: 2119 [2021-11-06 14:42:32,908 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 14:42:32,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2119 states. [2021-11-06 14:42:32,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2119 to 2119. [2021-11-06 14:42:32,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2119 states, 2118 states have (on average 1.428706326723324) internal successors, (3026), 2118 states have internal predecessors, (3026), 0 states have call successors, (0), 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 14:42:32,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2119 states to 2119 states and 3026 transitions. [2021-11-06 14:42:32,974 INFO L78 Accepts]: Start accepts. Automaton has 2119 states and 3026 transitions. Word has length 69 [2021-11-06 14:42:32,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 14:42:32,974 INFO L470 AbstractCegarLoop]: Abstraction has 2119 states and 3026 transitions. [2021-11-06 14:42:32,974 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 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 14:42:32,974 INFO L276 IsEmpty]: Start isEmpty. Operand 2119 states and 3026 transitions. [2021-11-06 14:42:32,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-11-06 14:42:32,976 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 14:42:32,976 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 14:42:32,976 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-06 14:42:32,976 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 14:42:32,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 14:42:32,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1502691923, now seen corresponding path program 1 times [2021-11-06 14:42:32,977 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 14:42:32,977 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687812092] [2021-11-06 14:42:32,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 14:42:32,977 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 14:42:33,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 14:42:33,071 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-11-06 14:42:33,071 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 14:42:33,071 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687812092] [2021-11-06 14:42:33,071 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687812092] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-06 14:42:33,072 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [223083170] [2021-11-06 14:42:33,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 14:42:33,072 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 14:42:33,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 14:42:33,073 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 14:42:33,103 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 14:42:33,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 14:42:33,390 INFO L263 TraceCheckSpWp]: Trace formula consists of 936 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-06 14:42:33,395 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 14:42:33,571 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-11-06 14:42:33,572 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [223083170] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-06 14:42:33,572 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-06 14:42:33,572 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2021-11-06 14:42:33,572 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403273774] [2021-11-06 14:42:33,573 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 14:42:33,574 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 14:42:33,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 14:42:33,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 14:42:33,575 INFO L87 Difference]: Start difference. First operand 2119 states and 3026 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 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 14:42:33,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 14:42:33,651 INFO L93 Difference]: Finished difference Result 4230 states and 6044 transitions. [2021-11-06 14:42:33,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 14:42:33,652 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 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 71 [2021-11-06 14:42:33,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 14:42:33,668 INFO L225 Difference]: With dead ends: 4230 [2021-11-06 14:42:33,668 INFO L226 Difference]: Without dead ends: 2121 [2021-11-06 14:42:33,672 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 14:42:33,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2121 states. [2021-11-06 14:42:33,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2121 to 2121. [2021-11-06 14:42:33,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2121 states, 2120 states have (on average 1.4283018867924528) internal successors, (3028), 2120 states have internal predecessors, (3028), 0 states have call successors, (0), 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 14:42:33,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2121 states to 2121 states and 3028 transitions. [2021-11-06 14:42:33,742 INFO L78 Accepts]: Start accepts. Automaton has 2121 states and 3028 transitions. Word has length 71 [2021-11-06 14:42:33,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 14:42:33,743 INFO L470 AbstractCegarLoop]: Abstraction has 2121 states and 3028 transitions. [2021-11-06 14:42:33,743 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 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 14:42:33,743 INFO L276 IsEmpty]: Start isEmpty. Operand 2121 states and 3028 transitions. [2021-11-06 14:42:33,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-11-06 14:42:33,744 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 14:42:33,745 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 14:42:33,764 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 14:42:33,964 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 14:42:33,965 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 14:42:33,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 14:42:33,965 INFO L85 PathProgramCache]: Analyzing trace with hash 682645487, now seen corresponding path program 2 times [2021-11-06 14:42:33,965 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 14:42:33,965 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283061710] [2021-11-06 14:42:33,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 14:42:33,966 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 14:42:34,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 14:42:34,091 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-11-06 14:42:34,092 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 14:42:34,092 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283061710] [2021-11-06 14:42:34,093 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283061710] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-06 14:42:34,093 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [260627047] [2021-11-06 14:42:34,093 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-06 14:42:34,093 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 14:42:34,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 14:42:34,094 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-06 14:42:34,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-06 14:42:35,021 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-06 14:42:35,021 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-06 14:42:35,028 INFO L263 TraceCheckSpWp]: Trace formula consists of 948 conjuncts, 16 conjunts are in the unsatisfiable core [2021-11-06 14:42:35,030 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 14:42:35,189 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-11-06 14:42:35,189 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [260627047] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-06 14:42:35,189 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-06 14:42:35,189 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2021-11-06 14:42:35,189 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900336100] [2021-11-06 14:42:35,190 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-06 14:42:35,190 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 14:42:35,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-06 14:42:35,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-11-06 14:42:35,191 INFO L87 Difference]: Start difference. First operand 2121 states and 3028 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 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 14:42:35,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 14:42:35,307 INFO L93 Difference]: Finished difference Result 4233 states and 6047 transitions. [2021-11-06 14:42:35,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 14:42:35,308 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2021-11-06 14:42:35,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 14:42:35,315 INFO L225 Difference]: With dead ends: 4233 [2021-11-06 14:42:35,316 INFO L226 Difference]: Without dead ends: 2123 [2021-11-06 14:42:35,318 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-11-06 14:42:35,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2123 states. [2021-11-06 14:42:35,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2123 to 2123. [2021-11-06 14:42:35,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2123 states, 2122 states have (on average 1.4278982092365693) internal successors, (3030), 2122 states have internal predecessors, (3030), 0 states have call successors, (0), 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 14:42:35,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2123 states to 2123 states and 3030 transitions. [2021-11-06 14:42:35,403 INFO L78 Accepts]: Start accepts. Automaton has 2123 states and 3030 transitions. Word has length 73 [2021-11-06 14:42:35,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 14:42:35,403 INFO L470 AbstractCegarLoop]: Abstraction has 2123 states and 3030 transitions. [2021-11-06 14:42:35,403 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 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 14:42:35,404 INFO L276 IsEmpty]: Start isEmpty. Operand 2123 states and 3030 transitions. [2021-11-06 14:42:35,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-11-06 14:42:35,410 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 14:42:35,410 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 14:42:35,443 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-06 14:42:35,623 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2021-11-06 14:42:35,624 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 14:42:35,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 14:42:35,624 INFO L85 PathProgramCache]: Analyzing trace with hash -702329453, now seen corresponding path program 3 times [2021-11-06 14:42:35,624 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 14:42:35,624 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862811525] [2021-11-06 14:42:35,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 14:42:35,624 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 14:42:35,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 14:42:35,724 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-11-06 14:42:35,724 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 14:42:35,724 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862811525] [2021-11-06 14:42:35,724 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862811525] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-06 14:42:35,725 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1561009321] [2021-11-06 14:42:35,725 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-06 14:42:35,725 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 14:42:35,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 14:42:35,726 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-06 14:42:35,727 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-06 14:42:36,777 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-06 14:42:36,778 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-06 14:42:36,786 INFO L263 TraceCheckSpWp]: Trace formula consists of 773 conjuncts, 46 conjunts are in the unsatisfiable core [2021-11-06 14:42:36,789 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 14:42:37,149 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-11-06 14:42:37,149 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1561009321] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 14:42:37,150 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-11-06 14:42:37,150 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [6] total 15 [2021-11-06 14:42:37,150 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119065551] [2021-11-06 14:42:37,150 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-06 14:42:37,151 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 14:42:37,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-06 14:42:37,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2021-11-06 14:42:37,151 INFO L87 Difference]: Start difference. First operand 2123 states and 3030 transitions. Second operand has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 0 states have call successors, (0), 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 14:42:39,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 14:42:39,607 INFO L93 Difference]: Finished difference Result 16224 states and 23787 transitions. [2021-11-06 14:42:39,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-11-06 14:42:39,608 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 0 states have call successors, (0), 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 75 [2021-11-06 14:42:39,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 14:42:39,635 INFO L225 Difference]: With dead ends: 16224 [2021-11-06 14:42:39,635 INFO L226 Difference]: Without dead ends: 14119 [2021-11-06 14:42:39,641 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=403, Invalid=1403, Unknown=0, NotChecked=0, Total=1806 [2021-11-06 14:42:39,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14119 states. [2021-11-06 14:42:39,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14119 to 2235. [2021-11-06 14:42:39,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2235 states, 2234 states have (on average 1.406445837063563) internal successors, (3142), 2234 states have internal predecessors, (3142), 0 states have call successors, (0), 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 14:42:39,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2235 states to 2235 states and 3142 transitions. [2021-11-06 14:42:39,816 INFO L78 Accepts]: Start accepts. Automaton has 2235 states and 3142 transitions. Word has length 75 [2021-11-06 14:42:39,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 14:42:39,816 INFO L470 AbstractCegarLoop]: Abstraction has 2235 states and 3142 transitions. [2021-11-06 14:42:39,816 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 0 states have call successors, (0), 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 14:42:39,817 INFO L276 IsEmpty]: Start isEmpty. Operand 2235 states and 3142 transitions. [2021-11-06 14:42:39,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-11-06 14:42:39,819 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 14:42:39,819 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 14:42:39,838 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-06 14:42:40,035 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 14:42:40,035 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 14:42:40,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 14:42:40,036 INFO L85 PathProgramCache]: Analyzing trace with hash -444913581, now seen corresponding path program 1 times [2021-11-06 14:42:40,036 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 14:42:40,036 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73323312] [2021-11-06 14:42:40,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 14:42:40,036 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 14:42:40,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 14:42:40,192 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-11-06 14:42:40,192 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 14:42:40,192 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73323312] [2021-11-06 14:42:40,192 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73323312] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-06 14:42:40,193 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [152587147] [2021-11-06 14:42:40,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 14:42:40,193 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 14:42:40,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 14:42:40,194 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-06 14:42:40,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-06 14:42:40,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 14:42:40,678 INFO L263 TraceCheckSpWp]: Trace formula consists of 1099 conjuncts, 55 conjunts are in the unsatisfiable core [2021-11-06 14:42:40,681 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 14:42:40,938 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2021-11-06 14:42:41,154 INFO L354 Elim1Store]: treesize reduction 70, result has 24.7 percent of original size [2021-11-06 14:42:41,155 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 45 treesize of output 60 [2021-11-06 14:42:41,180 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2021-11-06 14:42:52,663 INFO L354 Elim1Store]: treesize reduction 34, result has 22.7 percent of original size [2021-11-06 14:42:52,663 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 69 treesize of output 67 [2021-11-06 14:42:52,666 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Should have been eliminated by DER [2021-11-06 14:42:52,666 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-11-06 14:42:52,666 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2021-11-06 14:42:52,666 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020651106] [2021-11-06 14:42:52,666 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-06 14:42:52,666 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 14:42:52,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-06 14:42:52,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=285, Unknown=5, NotChecked=0, Total=342 [2021-11-06 14:42:52,667 INFO L87 Difference]: Start difference. First operand 2235 states and 3142 transitions. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 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 14:42:52,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-06 14:42:52,689 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-11-06 14:42:52,868 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 14:42:52,868 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@3f177454 at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:82) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.assertCodeBlock(IncrementalHoareTripleChecker.java:356) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.prepareAssertionStackAndAddTransition(IncrementalHoareTripleChecker.java:204) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.checkInternal(IncrementalHoareTripleChecker.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ProtectiveHoareTripleChecker.checkInternal(ProtectiveHoareTripleChecker.java:61) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.EfficientHoareTripleChecker.checkInternal(EfficientHoareTripleChecker.java:63) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:357) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.addOtherSuccessors(DeterministicInterpolantAutomaton.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:78) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1058) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:960) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:182) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:869) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:783) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:462) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:420) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-06 14:42:52,871 INFO L168 Benchmark]: Toolchain (without parser) took 26773.18 ms. Allocated memory was 132.1 MB in the beginning and 474.0 MB in the end (delta: 341.8 MB). Free memory was 90.8 MB in the beginning and 259.1 MB in the end (delta: -168.3 MB). Peak memory consumption was 172.6 MB. Max. memory is 16.1 GB. [2021-11-06 14:42:52,872 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 75.5 MB. Free memory was 33.9 MB in the beginning and 33.9 MB in the end (delta: 36.6 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-11-06 14:42:52,872 INFO L168 Benchmark]: CACSL2BoogieTranslator took 981.59 ms. Allocated memory is still 132.1 MB. Free memory was 90.5 MB in the beginning and 74.4 MB in the end (delta: 16.1 MB). Peak memory consumption was 56.7 MB. Max. memory is 16.1 GB. [2021-11-06 14:42:52,872 INFO L168 Benchmark]: Boogie Procedure Inliner took 124.06 ms. Allocated memory is still 132.1 MB. Free memory was 74.4 MB in the beginning and 60.7 MB in the end (delta: 13.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. [2021-11-06 14:42:52,872 INFO L168 Benchmark]: Boogie Preprocessor took 148.89 ms. Allocated memory was 132.1 MB in the beginning and 182.5 MB in the end (delta: 50.3 MB). Free memory was 60.7 MB in the beginning and 125.4 MB in the end (delta: -64.7 MB). Peak memory consumption was 22.7 MB. Max. memory is 16.1 GB. [2021-11-06 14:42:52,872 INFO L168 Benchmark]: RCFGBuilder took 2275.09 ms. Allocated memory is still 182.5 MB. Free memory was 125.4 MB in the beginning and 66.3 MB in the end (delta: 59.1 MB). Peak memory consumption was 92.4 MB. Max. memory is 16.1 GB. [2021-11-06 14:42:52,873 INFO L168 Benchmark]: TraceAbstraction took 23237.80 ms. Allocated memory was 182.5 MB in the beginning and 474.0 MB in the end (delta: 291.5 MB). Free memory was 65.2 MB in the beginning and 259.1 MB in the end (delta: -193.9 MB). Peak memory consumption was 97.3 MB. Max. memory is 16.1 GB. [2021-11-06 14:42:52,874 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.15 ms. Allocated memory is still 75.5 MB. Free memory was 33.9 MB in the beginning and 33.9 MB in the end (delta: 36.6 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 981.59 ms. Allocated memory is still 132.1 MB. Free memory was 90.5 MB in the beginning and 74.4 MB in the end (delta: 16.1 MB). Peak memory consumption was 56.7 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 124.06 ms. Allocated memory is still 132.1 MB. Free memory was 74.4 MB in the beginning and 60.7 MB in the end (delta: 13.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 148.89 ms. Allocated memory was 132.1 MB in the beginning and 182.5 MB in the end (delta: 50.3 MB). Free memory was 60.7 MB in the beginning and 125.4 MB in the end (delta: -64.7 MB). Peak memory consumption was 22.7 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2275.09 ms. Allocated memory is still 182.5 MB. Free memory was 125.4 MB in the beginning and 66.3 MB in the end (delta: 59.1 MB). Peak memory consumption was 92.4 MB. Max. memory is 16.1 GB. * TraceAbstraction took 23237.80 ms. Allocated memory was 182.5 MB in the beginning and 474.0 MB in the end (delta: 291.5 MB). Free memory was 65.2 MB in the beginning and 259.1 MB in the end (delta: -193.9 MB). Peak memory consumption was 97.3 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@3f177454 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@3f177454: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:82) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2021-11-06 14:42:52,898 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, 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.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--usb--cx82310_eth.ko-entry_point.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 4e983f35cff7a0c67962e23f6c3d66292f25c728e4d1df204c975f306d1512a3 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-173e394 [2021-11-06 14:42:54,455 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-06 14:42:54,457 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-06 14:42:54,481 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-06 14:42:54,483 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-06 14:42:54,485 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-06 14:42:54,487 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-06 14:42:54,490 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-06 14:42:54,492 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-06 14:42:54,495 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-06 14:42:54,495 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-06 14:42:54,496 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-06 14:42:54,496 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-06 14:42:54,498 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-06 14:42:54,500 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-06 14:42:54,502 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-06 14:42:54,503 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-06 14:42:54,504 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-06 14:42:54,506 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-06 14:42:54,508 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-06 14:42:54,509 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-06 14:42:54,509 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-06 14:42:54,510 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-06 14:42:54,511 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-06 14:42:54,512 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-06 14:42:54,515 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-06 14:42:54,515 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-06 14:42:54,515 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-06 14:42:54,516 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-06 14:42:54,517 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-06 14:42:54,517 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-06 14:42:54,517 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-06 14:42:54,518 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-06 14:42:54,519 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-06 14:42:54,520 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-06 14:42:54,520 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-06 14:42:54,520 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-06 14:42:54,521 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-06 14:42:54,521 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-06 14:42:54,522 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-06 14:42:54,522 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-06 14:42:54,523 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2021-11-06 14:42:54,543 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-06 14:42:54,545 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-06 14:42:54,546 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-06 14:42:54,546 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-06 14:42:54,547 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-06 14:42:54,547 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-06 14:42:54,548 INFO L138 SettingsManager]: * Use SBE=true [2021-11-06 14:42:54,548 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-06 14:42:54,548 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-06 14:42:54,548 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-06 14:42:54,549 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-06 14:42:54,549 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-06 14:42:54,549 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-11-06 14:42:54,549 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-11-06 14:42:54,549 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-06 14:42:54,549 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-06 14:42:54,550 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-06 14:42:54,550 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-06 14:42:54,550 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-06 14:42:54,550 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-06 14:42:54,550 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-06 14:42:54,550 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-06 14:42:54,550 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-06 14:42:54,551 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-06 14:42:54,551 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-11-06 14:42:54,551 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-11-06 14:42:54,551 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-06 14:42:54,551 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-06 14:42:54,551 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-06 14:42:54,551 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-06 14:42:54,552 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-06 14:42:54,552 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 -> 4e983f35cff7a0c67962e23f6c3d66292f25c728e4d1df204c975f306d1512a3 [2021-11-06 14:42:54,799 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-06 14:42:54,812 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-06 14:42:54,813 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-06 14:42:54,814 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-06 14:42:54,814 INFO L275 PluginConnector]: CDTParser initialized [2021-11-06 14:42:54,815 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--usb--cx82310_eth.ko-entry_point.cil.out.i [2021-11-06 14:42:54,865 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/505f0257c/11f93a2bc1c2498d972a66f088b94e44/FLAG1fb777f9a [2021-11-06 14:42:55,400 INFO L306 CDTParser]: Found 1 translation units. [2021-11-06 14:42:55,401 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--usb--cx82310_eth.ko-entry_point.cil.out.i [2021-11-06 14:42:55,425 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/505f0257c/11f93a2bc1c2498d972a66f088b94e44/FLAG1fb777f9a [2021-11-06 14:42:55,892 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/505f0257c/11f93a2bc1c2498d972a66f088b94e44 [2021-11-06 14:42:55,894 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-06 14:42:55,895 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-06 14:42:55,896 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-06 14:42:55,896 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-06 14:42:55,898 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-06 14:42:55,899 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 02:42:55" (1/1) ... [2021-11-06 14:42:55,900 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d2a52d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 02:42:55, skipping insertion in model container [2021-11-06 14:42:55,900 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 02:42:55" (1/1) ... [2021-11-06 14:42:55,905 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-06 14:42:55,980 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-06 14:42:56,431 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--usb--cx82310_eth.ko-entry_point.cil.out.i[159401,159414] [2021-11-06 14:42:56,609 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-06 14:42:56,634 INFO L203 MainTranslator]: Completed pre-run [2021-11-06 14:42:56,726 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--usb--cx82310_eth.ko-entry_point.cil.out.i[159401,159414] [2021-11-06 14:42:56,787 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-06 14:42:56,817 INFO L208 MainTranslator]: Completed translation [2021-11-06 14:42:56,818 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 02:42:56 WrapperNode [2021-11-06 14:42:56,818 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-06 14:42:56,819 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-06 14:42:56,848 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-06 14:42:56,848 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-06 14:42:56,853 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 02:42:56" (1/1) ... [2021-11-06 14:42:56,891 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 02:42:56" (1/1) ... [2021-11-06 14:42:56,956 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-06 14:42:56,957 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-06 14:42:56,957 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-06 14:42:56,957 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-06 14:42:56,963 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 02:42:56" (1/1) ... [2021-11-06 14:42:56,964 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 02:42:56" (1/1) ... [2021-11-06 14:42:56,979 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 02:42:56" (1/1) ... [2021-11-06 14:42:56,980 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 02:42:56" (1/1) ... [2021-11-06 14:42:57,050 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 02:42:56" (1/1) ... [2021-11-06 14:42:57,061 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 02:42:56" (1/1) ... [2021-11-06 14:42:57,077 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 02:42:56" (1/1) ... [2021-11-06 14:42:57,092 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-06 14:42:57,097 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-06 14:42:57,097 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-06 14:42:57,097 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-06 14:42:57,098 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 02:42:56" (1/1) ... [2021-11-06 14:42:57,103 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-06 14:42:57,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 14:42:57,124 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 14:42:57,142 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 14:42:57,153 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2021-11-06 14:42:57,154 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2021-11-06 14:42:57,154 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-11-06 14:42:57,154 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2021-11-06 14:42:57,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2021-11-06 14:42:57,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2021-11-06 14:42:57,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2 [2021-11-06 14:42:57,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1 [2021-11-06 14:42:57,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE8 [2021-11-06 14:42:57,155 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-06 14:42:57,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-06 14:42:57,155 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-06 14:42:57,155 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE8 [2021-11-06 14:42:57,156 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE2 [2021-11-06 14:42:57,156 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE4 [2021-11-06 14:42:57,156 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-06 14:42:57,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2021-11-06 14:42:57,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2021-11-06 14:42:57,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2 [2021-11-06 14:42:57,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-11-06 14:42:57,157 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-06 14:42:57,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-06 14:42:57,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-11-06 14:42:57,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2021-11-06 14:42:57,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE8 [2021-11-06 14:42:57,157 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE1 [2021-11-06 14:42:57,157 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-06 14:42:57,157 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-06 14:43:06,849 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-06 14:43:06,849 INFO L299 CfgBuilder]: Removed 377 assume(true) statements. [2021-11-06 14:43:06,851 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 02:43:06 BoogieIcfgContainer [2021-11-06 14:43:06,851 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-06 14:43:06,852 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-06 14:43:06,852 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-06 14:43:06,855 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-06 14:43:06,855 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 02:42:55" (1/3) ... [2021-11-06 14:43:06,856 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2617a8c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 02:43:06, skipping insertion in model container [2021-11-06 14:43:06,856 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 02:42:56" (2/3) ... [2021-11-06 14:43:06,856 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2617a8c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 02:43:06, skipping insertion in model container [2021-11-06 14:43:06,856 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 02:43:06" (3/3) ... [2021-11-06 14:43:06,857 INFO L111 eAbstractionObserver]: Analyzing ICFG 205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--usb--cx82310_eth.ko-entry_point.cil.out.i [2021-11-06 14:43:06,861 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-06 14:43:06,861 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-06 14:43:06,894 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-06 14:43:06,902 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 14:43:06,902 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-06 14:43:06,925 INFO L276 IsEmpty]: Start isEmpty. Operand has 449 states, 447 states have (on average 1.5100671140939597) internal successors, (675), 448 states have internal predecessors, (675), 0 states have call successors, (0), 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 14:43:06,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-11-06 14:43:06,933 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 14:43:06,934 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] [2021-11-06 14:43:06,934 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 14:43:06,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 14:43:06,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1795372011, now seen corresponding path program 1 times [2021-11-06 14:43:06,950 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 14:43:06,950 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [705063699] [2021-11-06 14:43:06,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 14:43:06,951 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 14:43:06,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 14:43:06,953 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 14:43:06,962 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 14:43:07,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 14:43:07,315 INFO L263 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-06 14:43:07,319 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 14:43:07,560 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 14:43:07,560 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 14:43:07,710 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 14:43:07,711 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 14:43:07,711 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [705063699] [2021-11-06 14:43:07,711 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [705063699] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 14:43:07,711 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 14:43:07,711 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-11-06 14:43:07,713 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559978484] [2021-11-06 14:43:07,715 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 14:43:07,716 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 14:43:07,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 14:43:07,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-06 14:43:07,728 INFO L87 Difference]: Start difference. First operand has 449 states, 447 states have (on average 1.5100671140939597) internal successors, (675), 448 states have internal predecessors, (675), 0 states have call successors, (0), 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 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 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 14:43:07,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 14:43:07,891 INFO L93 Difference]: Finished difference Result 897 states and 1351 transitions. [2021-11-06 14:43:07,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 14:43:07,903 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 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 21 [2021-11-06 14:43:07,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 14:43:07,913 INFO L225 Difference]: With dead ends: 897 [2021-11-06 14:43:07,913 INFO L226 Difference]: Without dead ends: 445 [2021-11-06 14:43:07,916 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 38 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 14:43:07,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2021-11-06 14:43:07,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 445. [2021-11-06 14:43:07,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 444 states have (on average 1.4166666666666667) internal successors, (629), 444 states have internal predecessors, (629), 0 states have call successors, (0), 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 14:43:07,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 629 transitions. [2021-11-06 14:43:07,962 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 629 transitions. Word has length 21 [2021-11-06 14:43:07,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 14:43:07,962 INFO L470 AbstractCegarLoop]: Abstraction has 445 states and 629 transitions. [2021-11-06 14:43:07,962 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 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 14:43:07,962 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 629 transitions. [2021-11-06 14:43:07,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-06 14:43:07,964 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 14:43:07,964 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] [2021-11-06 14:43:07,978 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-11-06 14:43:08,171 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 14:43:08,172 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 14:43:08,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 14:43:08,172 INFO L85 PathProgramCache]: Analyzing trace with hash -815280085, now seen corresponding path program 1 times [2021-11-06 14:43:08,173 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 14:43:08,173 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2100963795] [2021-11-06 14:43:08,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 14:43:08,173 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 14:43:08,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 14:43:08,176 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 14:43:08,215 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 14:43:08,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 14:43:08,474 INFO L263 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-06 14:43:08,475 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 14:43:08,782 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-06 14:43:08,782 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 14:43:09,207 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-06 14:43:09,207 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 14:43:09,208 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2100963795] [2021-11-06 14:43:09,208 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2100963795] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-06 14:43:09,208 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-06 14:43:09,208 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2021-11-06 14:43:09,208 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466420513] [2021-11-06 14:43:09,209 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-06 14:43:09,209 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 14:43:09,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-06 14:43:09,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-11-06 14:43:09,210 INFO L87 Difference]: Start difference. First operand 445 states and 629 transitions. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 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 14:43:09,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 14:43:09,442 INFO L93 Difference]: Finished difference Result 883 states and 1253 transitions. [2021-11-06 14:43:09,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-06 14:43:09,447 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 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 25 [2021-11-06 14:43:09,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 14:43:09,450 INFO L225 Difference]: With dead ends: 883 [2021-11-06 14:43:09,450 INFO L226 Difference]: Without dead ends: 449 [2021-11-06 14:43:09,454 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 42 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 14:43:09,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2021-11-06 14:43:09,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 449. [2021-11-06 14:43:09,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 449 states, 448 states have (on average 1.4129464285714286) internal successors, (633), 448 states have internal predecessors, (633), 0 states have call successors, (0), 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 14:43:09,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 633 transitions. [2021-11-06 14:43:09,480 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 633 transitions. Word has length 25 [2021-11-06 14:43:09,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 14:43:09,480 INFO L470 AbstractCegarLoop]: Abstraction has 449 states and 633 transitions. [2021-11-06 14:43:09,480 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 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 14:43:09,480 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 633 transitions. [2021-11-06 14:43:09,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-11-06 14:43:09,484 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 14:43:09,484 INFO L513 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 14:43:09,498 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 14:43:09,695 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 14:43:09,696 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 14:43:09,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 14:43:09,696 INFO L85 PathProgramCache]: Analyzing trace with hash -71275413, now seen corresponding path program 2 times [2021-11-06 14:43:09,697 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 14:43:09,697 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [143455678] [2021-11-06 14:43:09,697 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-06 14:43:09,697 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 14:43:09,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 14:43:09,703 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 14:43:09,706 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 14:43:09,957 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-11-06 14:43:09,958 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-06 14:43:09,971 INFO L263 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-06 14:43:09,973 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 14:43:10,117 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-11-06 14:43:10,117 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 14:43:10,274 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-11-06 14:43:10,274 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 14:43:10,275 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [143455678] [2021-11-06 14:43:10,275 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [143455678] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 14:43:10,275 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 14:43:10,275 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-11-06 14:43:10,275 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750095273] [2021-11-06 14:43:10,276 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 14:43:10,276 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 14:43:10,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 14:43:10,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-06 14:43:10,277 INFO L87 Difference]: Start difference. First operand 449 states and 633 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 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 14:43:12,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 14:43:12,543 INFO L93 Difference]: Finished difference Result 1671 states and 2389 transitions. [2021-11-06 14:43:12,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 14:43:12,544 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 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 29 [2021-11-06 14:43:12,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 14:43:12,548 INFO L225 Difference]: With dead ends: 1671 [2021-11-06 14:43:12,548 INFO L226 Difference]: Without dead ends: 1242 [2021-11-06 14:43:12,549 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 54 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 14:43:12,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1242 states. [2021-11-06 14:43:12,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1242 to 1242. [2021-11-06 14:43:12,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1242 states, 1241 states have (on average 1.4302981466559226) internal successors, (1775), 1241 states have internal predecessors, (1775), 0 states have call successors, (0), 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 14:43:12,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1242 states to 1242 states and 1775 transitions. [2021-11-06 14:43:12,582 INFO L78 Accepts]: Start accepts. Automaton has 1242 states and 1775 transitions. Word has length 29 [2021-11-06 14:43:12,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 14:43:12,583 INFO L470 AbstractCegarLoop]: Abstraction has 1242 states and 1775 transitions. [2021-11-06 14:43:12,583 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 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 14:43:12,583 INFO L276 IsEmpty]: Start isEmpty. Operand 1242 states and 1775 transitions. [2021-11-06 14:43:12,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-06 14:43:12,585 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 14:43:12,586 INFO L513 BasicCegarLoop]: trace histogram [4, 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] [2021-11-06 14:43:12,599 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 14:43:12,795 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 14:43:12,796 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 14:43:12,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 14:43:12,796 INFO L85 PathProgramCache]: Analyzing trace with hash 354616610, now seen corresponding path program 1 times [2021-11-06 14:43:12,797 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 14:43:12,797 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1242352697] [2021-11-06 14:43:12,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 14:43:12,797 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 14:43:12,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 14:43:12,799 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 14:43:12,801 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 14:43:13,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 14:43:13,149 INFO L263 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-06 14:43:13,151 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 14:43:13,578 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-11-06 14:43:13,579 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 14:43:14,028 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-11-06 14:43:14,028 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 14:43:14,029 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1242352697] [2021-11-06 14:43:14,029 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1242352697] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 14:43:14,029 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 14:43:14,029 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 7 [2021-11-06 14:43:14,029 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225466102] [2021-11-06 14:43:14,029 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-06 14:43:14,029 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 14:43:14,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-06 14:43:14,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-11-06 14:43:14,030 INFO L87 Difference]: Start difference. First operand 1242 states and 1775 transitions. Second operand has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 0 states have call successors, (0), 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 14:43:14,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 14:43:14,660 INFO L93 Difference]: Finished difference Result 3684 states and 5278 transitions. [2021-11-06 14:43:14,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 14:43:14,660 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 0 states have call successors, (0), 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 36 [2021-11-06 14:43:14,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 14:43:14,668 INFO L225 Difference]: With dead ends: 3684 [2021-11-06 14:43:14,668 INFO L226 Difference]: Without dead ends: 2457 [2021-11-06 14:43:14,670 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2021-11-06 14:43:14,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2457 states. [2021-11-06 14:43:14,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2457 to 2457. [2021-11-06 14:43:14,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2457 states, 2456 states have (on average 1.4275244299674268) internal successors, (3506), 2456 states have internal predecessors, (3506), 0 states have call successors, (0), 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 14:43:14,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2457 states to 2457 states and 3506 transitions. [2021-11-06 14:43:14,719 INFO L78 Accepts]: Start accepts. Automaton has 2457 states and 3506 transitions. Word has length 36 [2021-11-06 14:43:14,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 14:43:14,719 INFO L470 AbstractCegarLoop]: Abstraction has 2457 states and 3506 transitions. [2021-11-06 14:43:14,720 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 0 states have call successors, (0), 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 14:43:14,720 INFO L276 IsEmpty]: Start isEmpty. Operand 2457 states and 3506 transitions. [2021-11-06 14:43:14,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-11-06 14:43:14,724 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 14:43:14,724 INFO L513 BasicCegarLoop]: trace histogram [4, 4, 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] [2021-11-06 14:43:14,740 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 14:43:14,940 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 14:43:14,940 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 14:43:14,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 14:43:14,941 INFO L85 PathProgramCache]: Analyzing trace with hash -1382112580, now seen corresponding path program 1 times [2021-11-06 14:43:14,941 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 14:43:14,941 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1848104394] [2021-11-06 14:43:14,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 14:43:14,942 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 14:43:14,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 14:43:14,943 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 14:43:14,945 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 14:43:15,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 14:43:15,340 INFO L263 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-06 14:43:15,342 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 14:43:15,635 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-11-06 14:43:15,636 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 14:43:15,924 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-11-06 14:43:15,925 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 14:43:15,925 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1848104394] [2021-11-06 14:43:15,925 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1848104394] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 14:43:15,925 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 14:43:15,925 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-11-06 14:43:15,925 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839265203] [2021-11-06 14:43:15,926 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 14:43:15,926 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 14:43:15,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 14:43:15,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 14:43:15,927 INFO L87 Difference]: Start difference. First operand 2457 states and 3506 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 14:43:16,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 14:43:16,188 INFO L93 Difference]: Finished difference Result 5151 states and 7391 transitions. [2021-11-06 14:43:16,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 14:43:16,189 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 58 [2021-11-06 14:43:16,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 14:43:16,197 INFO L225 Difference]: With dead ends: 5151 [2021-11-06 14:43:16,197 INFO L226 Difference]: Without dead ends: 2714 [2021-11-06 14:43:16,201 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 113 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 14:43:16,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2714 states. [2021-11-06 14:43:16,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2714 to 2669. [2021-11-06 14:43:16,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2669 states, 2668 states have (on average 1.4374062968515742) internal successors, (3835), 2668 states have internal predecessors, (3835), 0 states have call successors, (0), 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 14:43:16,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2669 states to 2669 states and 3835 transitions. [2021-11-06 14:43:16,248 INFO L78 Accepts]: Start accepts. Automaton has 2669 states and 3835 transitions. Word has length 58 [2021-11-06 14:43:16,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 14:43:16,249 INFO L470 AbstractCegarLoop]: Abstraction has 2669 states and 3835 transitions. [2021-11-06 14:43:16,250 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 14:43:16,250 INFO L276 IsEmpty]: Start isEmpty. Operand 2669 states and 3835 transitions. [2021-11-06 14:43:16,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-11-06 14:43:16,252 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 14:43:16,252 INFO L513 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 14:43:16,279 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-11-06 14:43:16,466 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 14:43:16,467 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 14:43:16,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 14:43:16,467 INFO L85 PathProgramCache]: Analyzing trace with hash -1249517548, now seen corresponding path program 1 times [2021-11-06 14:43:16,468 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 14:43:16,468 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [437752487] [2021-11-06 14:43:16,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 14:43:16,468 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 14:43:16,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 14:43:16,469 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 14:43:16,470 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 14:43:16,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 14:43:16,881 INFO L263 TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-06 14:43:16,883 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 14:43:17,259 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-11-06 14:43:17,259 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 14:43:17,591 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-11-06 14:43:17,591 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 14:43:17,591 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [437752487] [2021-11-06 14:43:17,591 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [437752487] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 14:43:17,591 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 14:43:17,591 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-11-06 14:43:17,592 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932461680] [2021-11-06 14:43:17,592 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 14:43:17,592 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 14:43:17,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 14:43:17,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 14:43:17,593 INFO L87 Difference]: Start difference. First operand 2669 states and 3835 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 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 14:43:19,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 14:43:19,868 INFO L93 Difference]: Finished difference Result 5647 states and 8181 transitions. [2021-11-06 14:43:19,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 14:43:19,869 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 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 72 [2021-11-06 14:43:19,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 14:43:19,877 INFO L225 Difference]: With dead ends: 5647 [2021-11-06 14:43:19,878 INFO L226 Difference]: Without dead ends: 2998 [2021-11-06 14:43:19,881 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 141 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 14:43:19,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2998 states. [2021-11-06 14:43:19,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2998 to 2991. [2021-11-06 14:43:19,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2991 states, 2990 states have (on average 1.4451505016722408) internal successors, (4321), 2990 states have internal predecessors, (4321), 0 states have call successors, (0), 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 14:43:19,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2991 states to 2991 states and 4321 transitions. [2021-11-06 14:43:19,953 INFO L78 Accepts]: Start accepts. Automaton has 2991 states and 4321 transitions. Word has length 72 [2021-11-06 14:43:19,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 14:43:19,954 INFO L470 AbstractCegarLoop]: Abstraction has 2991 states and 4321 transitions. [2021-11-06 14:43:19,954 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 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 14:43:19,954 INFO L276 IsEmpty]: Start isEmpty. Operand 2991 states and 4321 transitions. [2021-11-06 14:43:19,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-11-06 14:43:19,957 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 14:43:19,957 INFO L513 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 14:43:19,973 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Ended with exit code 0 [2021-11-06 14:43:20,171 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 14:43:20,171 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 14:43:20,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 14:43:20,172 INFO L85 PathProgramCache]: Analyzing trace with hash 1797171986, now seen corresponding path program 1 times [2021-11-06 14:43:20,172 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 14:43:20,173 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1577828918] [2021-11-06 14:43:20,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 14:43:20,173 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 14:43:20,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 14:43:20,174 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 14:43:20,175 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 14:43:20,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 14:43:20,621 INFO L263 TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-06 14:43:20,623 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 14:43:20,963 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2021-11-06 14:43:20,964 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 14:43:21,223 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2021-11-06 14:43:21,223 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 14:43:21,223 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1577828918] [2021-11-06 14:43:21,223 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1577828918] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 14:43:21,223 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 14:43:21,223 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2021-11-06 14:43:21,223 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634375867] [2021-11-06 14:43:21,224 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 14:43:21,224 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 14:43:21,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 14:43:21,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 14:43:21,224 INFO L87 Difference]: Start difference. First operand 2991 states and 4321 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 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 14:43:21,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 14:43:21,967 INFO L93 Difference]: Finished difference Result 13473 states and 19609 transitions. [2021-11-06 14:43:21,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 14:43:21,968 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 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 72 [2021-11-06 14:43:21,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 14:43:21,998 INFO L225 Difference]: With dead ends: 13473 [2021-11-06 14:43:21,999 INFO L226 Difference]: Without dead ends: 10502 [2021-11-06 14:43:22,005 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 141 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 14:43:22,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10502 states. [2021-11-06 14:43:22,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10502 to 3039. [2021-11-06 14:43:22,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3039 states, 3038 states have (on average 1.4381171823568137) internal successors, (4369), 3038 states have internal predecessors, (4369), 0 states have call successors, (0), 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 14:43:22,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3039 states to 3039 states and 4369 transitions. [2021-11-06 14:43:22,171 INFO L78 Accepts]: Start accepts. Automaton has 3039 states and 4369 transitions. Word has length 72 [2021-11-06 14:43:22,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 14:43:22,172 INFO L470 AbstractCegarLoop]: Abstraction has 3039 states and 4369 transitions. [2021-11-06 14:43:22,172 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 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 14:43:22,172 INFO L276 IsEmpty]: Start isEmpty. Operand 3039 states and 4369 transitions. [2021-11-06 14:43:22,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-11-06 14:43:22,174 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 14:43:22,174 INFO L513 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 14:43:22,191 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 14:43:22,387 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 14:43:22,388 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 14:43:22,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 14:43:22,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1074123766, now seen corresponding path program 1 times [2021-11-06 14:43:22,389 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 14:43:22,389 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1578365623] [2021-11-06 14:43:22,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 14:43:22,389 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 14:43:22,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 14:43:22,390 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 14:43:22,392 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 14:43:22,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 14:43:22,851 INFO L263 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-06 14:43:22,853 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 14:43:23,353 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2021-11-06 14:43:23,353 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 14:43:23,650 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2021-11-06 14:43:23,650 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 14:43:23,650 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1578365623] [2021-11-06 14:43:23,650 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1578365623] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 14:43:23,651 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 14:43:23,651 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 8 [2021-11-06 14:43:23,651 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187757192] [2021-11-06 14:43:23,651 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-06 14:43:23,651 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 14:43:23,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-06 14:43:23,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-11-06 14:43:23,652 INFO L87 Difference]: Start difference. First operand 3039 states and 4369 transitions. Second operand has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 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 14:43:26,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 14:43:26,444 INFO L93 Difference]: Finished difference Result 13017 states and 18949 transitions. [2021-11-06 14:43:26,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-06 14:43:26,445 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 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 75 [2021-11-06 14:43:26,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 14:43:26,472 INFO L225 Difference]: With dead ends: 13017 [2021-11-06 14:43:26,472 INFO L226 Difference]: Without dead ends: 9998 [2021-11-06 14:43:26,478 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2021-11-06 14:43:26,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9998 states. [2021-11-06 14:43:26,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9998 to 3087. [2021-11-06 14:43:26,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3087 states, 3086 states have (on average 1.4235255994815295) internal successors, (4393), 3086 states have internal predecessors, (4393), 0 states have call successors, (0), 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 14:43:26,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3087 states to 3087 states and 4393 transitions. [2021-11-06 14:43:26,733 INFO L78 Accepts]: Start accepts. Automaton has 3087 states and 4393 transitions. Word has length 75 [2021-11-06 14:43:26,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 14:43:26,733 INFO L470 AbstractCegarLoop]: Abstraction has 3087 states and 4393 transitions. [2021-11-06 14:43:26,733 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 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 14:43:26,734 INFO L276 IsEmpty]: Start isEmpty. Operand 3087 states and 4393 transitions. [2021-11-06 14:43:26,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-11-06 14:43:26,736 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 14:43:26,736 INFO L513 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 14:43:26,757 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-11-06 14:43:26,943 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 14:43:26,944 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 14:43:26,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 14:43:26,944 INFO L85 PathProgramCache]: Analyzing trace with hash 21460015, now seen corresponding path program 1 times [2021-11-06 14:43:26,945 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 14:43:26,945 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [773799960] [2021-11-06 14:43:26,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 14:43:26,945 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 14:43:26,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 14:43:26,946 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 14:43:26,946 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 14:43:27,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 14:43:27,441 INFO L263 TraceCheckSpWp]: Trace formula consists of 552 conjuncts, 21 conjunts are in the unsatisfiable core [2021-11-06 14:43:27,443 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 14:43:28,492 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2021-11-06 14:43:28,492 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 14:43:29,934 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2021-11-06 14:43:29,934 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 14:43:29,934 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [773799960] [2021-11-06 14:43:29,934 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [773799960] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 14:43:29,934 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 14:43:29,935 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 10] imperfect sequences [] total 18 [2021-11-06 14:43:29,935 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086184364] [2021-11-06 14:43:29,935 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-11-06 14:43:29,935 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 14:43:29,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-11-06 14:43:29,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2021-11-06 14:43:29,936 INFO L87 Difference]: Start difference. First operand 3087 states and 4393 transitions. Second operand has 18 states, 18 states have (on average 4.777777777777778) internal successors, (86), 18 states have internal predecessors, (86), 0 states have call successors, (0), 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 14:43:43,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 14:43:43,718 INFO L93 Difference]: Finished difference Result 21817 states and 31701 transitions. [2021-11-06 14:43:43,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-11-06 14:43:43,720 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.777777777777778) internal successors, (86), 18 states have internal predecessors, (86), 0 states have call successors, (0), 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 77 [2021-11-06 14:43:43,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 14:43:43,762 INFO L225 Difference]: With dead ends: 21817 [2021-11-06 14:43:43,762 INFO L226 Difference]: Without dead ends: 18750 [2021-11-06 14:43:43,771 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=505, Invalid=1387, Unknown=0, NotChecked=0, Total=1892 [2021-11-06 14:43:43,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18750 states. [2021-11-06 14:43:44,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18750 to 3255. [2021-11-06 14:43:44,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3255 states, 3254 states have (on average 1.4090350338045483) internal successors, (4585), 3254 states have internal predecessors, (4585), 0 states have call successors, (0), 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 14:43:44,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3255 states to 3255 states and 4585 transitions. [2021-11-06 14:43:44,057 INFO L78 Accepts]: Start accepts. Automaton has 3255 states and 4585 transitions. Word has length 77 [2021-11-06 14:43:44,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 14:43:44,057 INFO L470 AbstractCegarLoop]: Abstraction has 3255 states and 4585 transitions. [2021-11-06 14:43:44,057 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.777777777777778) internal successors, (86), 18 states have internal predecessors, (86), 0 states have call successors, (0), 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 14:43:44,057 INFO L276 IsEmpty]: Start isEmpty. Operand 3255 states and 4585 transitions. [2021-11-06 14:43:44,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-11-06 14:43:44,060 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 14:43:44,060 INFO L513 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 14:43:44,079 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 14:43:44,265 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 14:43:44,265 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 14:43:44,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 14:43:44,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1164854511, now seen corresponding path program 1 times [2021-11-06 14:43:44,266 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 14:43:44,266 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1000148790] [2021-11-06 14:43:44,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 14:43:44,267 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 14:43:44,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 14:43:44,268 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 14:43:44,269 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 14:43:46,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 14:43:46,975 INFO L263 TraceCheckSpWp]: Trace formula consists of 628 conjuncts, 31 conjunts are in the unsatisfiable core [2021-11-06 14:43:46,978 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 14:43:47,178 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-11-06 14:43:53,776 INFO L354 Elim1Store]: treesize reduction 20, result has 31.0 percent of original size [2021-11-06 14:43:53,776 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 44 [2021-11-06 14:44:11,364 INFO L354 Elim1Store]: treesize reduction 74, result has 23.7 percent of original size [2021-11-06 14:44:11,364 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 54 treesize of output 67 [2021-11-06 14:44:11,440 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 1 [2021-11-06 14:44:28,808 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 74 [2021-11-06 14:44:28,820 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 67 [2021-11-06 14:44:56,859 INFO L354 Elim1Store]: treesize reduction 34, result has 12.8 percent of original size [2021-11-06 14:44:56,859 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 74 treesize of output 66 [2021-11-06 14:45:31,495 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-06 14:45:31,495 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 84 [2021-11-06 14:45:31,507 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-11-06 14:45:31,507 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 12 [2021-11-06 14:45:31,961 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-11-06 14:45:31,962 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 14:45:34,569 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_skb_put_~arg0.offset_9 (_ BitVec 64)) (v_ULTIMATE.start_skb_put_~arg1_9 (_ BitVec 32))) (bvult (_ bv0 64) (let ((.cse0 (select (store |c_#memory_int| c_ULTIMATE.start_cx82310_rx_fixup_~skb2~0.base (let ((.cse1 (select |c_#memory_int| c_ULTIMATE.start_cx82310_rx_fixup_~skb2~0.base)) (.cse2 (bvadd (_ bv216 64) v_ULTIMATE.start_skb_put_~arg0.offset_9))) (store .cse1 .cse2 (bvadd (select .cse1 .cse2) v_ULTIMATE.start_skb_put_~arg1_9)))) c_ULTIMATE.start_cx82310_rx_fixup_~dev.base))) (concat (select .cse0 (bvadd (_ bv464 64) c_ULTIMATE.start_cx82310_rx_fixup_~dev.offset)) (select .cse0 (bvadd c_ULTIMATE.start_cx82310_rx_fixup_~dev.offset (_ bv460 64))))))) is different from false [2021-11-06 14:45:36,611 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_skb_put_~arg0.offset_9 (_ BitVec 64)) (v_ULTIMATE.start_skb_put_~arg1_9 (_ BitVec 32))) (bvult (_ bv0 64) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_ldv_alloc_skb_12_#res.base| (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_ldv_alloc_skb_12_#res.base|)) (.cse2 (bvadd (_ bv216 64) v_ULTIMATE.start_skb_put_~arg0.offset_9))) (store .cse1 .cse2 (bvadd (select .cse1 .cse2) v_ULTIMATE.start_skb_put_~arg1_9)))) c_ULTIMATE.start_cx82310_rx_fixup_~dev.base))) (concat (select .cse0 (bvadd (_ bv464 64) c_ULTIMATE.start_cx82310_rx_fixup_~dev.offset)) (select .cse0 (bvadd c_ULTIMATE.start_cx82310_rx_fixup_~dev.offset (_ bv460 64))))))) is different from false [2021-11-06 14:46:21,247 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_5 (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32)) (v_ULTIMATE.start_skb_put_~arg0.offset_9 (_ BitVec 64)) (v_ULTIMATE.start_skb_put_~arg1_9 (_ BitVec 32)) (ULTIMATE.start_ldv_alloc_skb_12_~tmp~12.offset (_ BitVec 64))) (bvult (_ bv0 64) (let ((.cse0 (select (store |c_#memory_int| c_ULTIMATE.start_ldv_skb_alloc_~skb~0.base (let ((.cse1 (store (store (select |c_#memory_int| c_ULTIMATE.start_ldv_skb_alloc_~skb~0.base) (bvadd (_ bv224 64) ULTIMATE.start_ldv_alloc_skb_12_~tmp~12.offset) v_DerPreprocessor_5) (bvadd (_ bv232 64) ULTIMATE.start_ldv_alloc_skb_12_~tmp~12.offset) v_DerPreprocessor_4)) (.cse2 (bvadd (_ bv216 64) v_ULTIMATE.start_skb_put_~arg0.offset_9))) (store .cse1 .cse2 (bvadd (select .cse1 .cse2) v_ULTIMATE.start_skb_put_~arg1_9)))) c_ULTIMATE.start_cx82310_rx_fixup_~dev.base))) (concat (select .cse0 (bvadd (_ bv464 64) c_ULTIMATE.start_cx82310_rx_fixup_~dev.offset)) (select .cse0 (bvadd c_ULTIMATE.start_cx82310_rx_fixup_~dev.offset (_ bv460 64))))))) is different from false [2021-11-06 14:46:23,323 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_6 (_ BitVec 32)) (v_DerPreprocessor_5 (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32)) (v_ULTIMATE.start_skb_put_~arg0.offset_9 (_ BitVec 64)) (~last_index~0 (_ BitVec 32)) (v_ULTIMATE.start_skb_put_~arg1_9 (_ BitVec 32)) (ULTIMATE.start_ldv_alloc_skb_12_~tmp~12.offset (_ BitVec 64)) (|~#set_impl~0.offset| (_ BitVec 64))) (bvult (_ bv0 64) (let ((.cse0 (select (let ((.cse1 (store |c_#memory_int| |c_~#set_impl~0.base| (store (select |c_#memory_int| |c_~#set_impl~0.base|) (bvadd |~#set_impl~0.offset| (bvmul ((_ sign_extend 32) ~last_index~0) (_ bv8 64))) v_DerPreprocessor_6)))) (store .cse1 c_ULTIMATE.start_ldv_skb_alloc_~skb~0.base (let ((.cse2 (store (store (select .cse1 c_ULTIMATE.start_ldv_skb_alloc_~skb~0.base) (bvadd (_ bv224 64) ULTIMATE.start_ldv_alloc_skb_12_~tmp~12.offset) v_DerPreprocessor_5) (bvadd (_ bv232 64) ULTIMATE.start_ldv_alloc_skb_12_~tmp~12.offset) v_DerPreprocessor_4)) (.cse3 (bvadd (_ bv216 64) v_ULTIMATE.start_skb_put_~arg0.offset_9))) (store .cse2 .cse3 (bvadd (select .cse2 .cse3) v_ULTIMATE.start_skb_put_~arg1_9))))) c_ULTIMATE.start_cx82310_rx_fixup_~dev.base))) (concat (select .cse0 (bvadd (_ bv464 64) c_ULTIMATE.start_cx82310_rx_fixup_~dev.offset)) (select .cse0 (bvadd c_ULTIMATE.start_cx82310_rx_fixup_~dev.offset (_ bv460 64))))))) is different from false [2021-11-06 14:46:44,463 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_6 (_ BitVec 32)) (v_DerPreprocessor_5 (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32)) (v_ULTIMATE.start_skb_put_~arg0.offset_9 (_ BitVec 64)) (~last_index~0 (_ BitVec 32)) (v_ULTIMATE.start_skb_put_~arg1_9 (_ BitVec 32)) (ULTIMATE.start_ldv_alloc_skb_12_~tmp~12.offset (_ BitVec 64)) (|~#set_impl~0.offset| (_ BitVec 64))) (bvult (_ bv0 64) (let ((.cse0 (select (let ((.cse1 (store |c_#memory_int| |c_~#set_impl~0.base| (store (select |c_#memory_int| |c_~#set_impl~0.base|) (bvadd |~#set_impl~0.offset| (bvmul ((_ sign_extend 32) ~last_index~0) (_ bv8 64))) v_DerPreprocessor_6)))) (store .cse1 c_ULTIMATE.start_ldv_zalloc_~p~1.base (let ((.cse2 (store (store (select .cse1 c_ULTIMATE.start_ldv_zalloc_~p~1.base) (bvadd (_ bv224 64) ULTIMATE.start_ldv_alloc_skb_12_~tmp~12.offset) v_DerPreprocessor_5) (bvadd (_ bv232 64) ULTIMATE.start_ldv_alloc_skb_12_~tmp~12.offset) v_DerPreprocessor_4)) (.cse3 (bvadd (_ bv216 64) v_ULTIMATE.start_skb_put_~arg0.offset_9))) (store .cse2 .cse3 (bvadd (select .cse2 .cse3) v_ULTIMATE.start_skb_put_~arg1_9))))) c_ULTIMATE.start_cx82310_rx_fixup_~dev.base))) (concat (select .cse0 (bvadd (_ bv464 64) c_ULTIMATE.start_cx82310_rx_fixup_~dev.offset)) (select .cse0 (bvadd c_ULTIMATE.start_cx82310_rx_fixup_~dev.offset (_ bv460 64))))))) is different from false [2021-11-06 14:46:46,559 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_6 (_ BitVec 32)) (v_DerPreprocessor_5 (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32)) (v_ULTIMATE.start_skb_put_~arg0.offset_9 (_ BitVec 64)) (~last_index~0 (_ BitVec 32)) (v_ULTIMATE.start_skb_put_~arg1_9 (_ BitVec 32)) (ULTIMATE.start_ldv_alloc_skb_12_~tmp~12.offset (_ BitVec 64)) (|~#set_impl~0.offset| (_ BitVec 64))) (bvult (_ bv0 64) (let ((.cse0 (select (let ((.cse1 (store |c_#memory_int| |c_~#set_impl~0.base| (store (select |c_#memory_int| |c_~#set_impl~0.base|) (bvadd |~#set_impl~0.offset| (bvmul ((_ sign_extend 32) ~last_index~0) (_ bv8 64))) v_DerPreprocessor_6)))) (store .cse1 |c_ULTIMATE.start_ldv_zalloc_#t~malloc35.base| (let ((.cse2 (store (store (select .cse1 |c_ULTIMATE.start_ldv_zalloc_#t~malloc35.base|) (bvadd (_ bv224 64) ULTIMATE.start_ldv_alloc_skb_12_~tmp~12.offset) v_DerPreprocessor_5) (bvadd (_ bv232 64) ULTIMATE.start_ldv_alloc_skb_12_~tmp~12.offset) v_DerPreprocessor_4)) (.cse3 (bvadd (_ bv216 64) v_ULTIMATE.start_skb_put_~arg0.offset_9))) (store .cse2 .cse3 (bvadd (select .cse2 .cse3) v_ULTIMATE.start_skb_put_~arg1_9))))) c_ULTIMATE.start_cx82310_rx_fixup_~dev.base))) (concat (select .cse0 (bvadd (_ bv464 64) c_ULTIMATE.start_cx82310_rx_fixup_~dev.offset)) (select .cse0 (bvadd c_ULTIMATE.start_cx82310_rx_fixup_~dev.offset (_ bv460 64))))))) is different from false [2021-11-06 14:46:48,811 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_6 (_ BitVec 32)) (v_DerPreprocessor_5 (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32)) (v_ULTIMATE.start_skb_put_~arg0.offset_9 (_ BitVec 64)) (~last_index~0 (_ BitVec 32)) (v_ULTIMATE.start_skb_put_~arg1_9 (_ BitVec 32)) (ULTIMATE.start_ldv_alloc_skb_12_~tmp~12.offset (_ BitVec 64)) (|~#set_impl~0.offset| (_ BitVec 64)) (|v_ULTIMATE.start_ldv_zalloc_#t~malloc35.base_37| (_ BitVec 64))) (or (= (_ bv0 64) |v_ULTIMATE.start_ldv_zalloc_#t~malloc35.base_37|) (bvult (_ bv0 64) (let ((.cse0 (select (let ((.cse1 (let ((.cse4 (store |c_#memory_int| |v_ULTIMATE.start_ldv_zalloc_#t~malloc35.base_37| ((as const (Array (_ BitVec 64) (_ BitVec 32))) (_ bv0 32))))) (store .cse4 |c_~#set_impl~0.base| (store (select .cse4 |c_~#set_impl~0.base|) (bvadd |~#set_impl~0.offset| (bvmul ((_ sign_extend 32) ~last_index~0) (_ bv8 64))) v_DerPreprocessor_6))))) (store .cse1 |v_ULTIMATE.start_ldv_zalloc_#t~malloc35.base_37| (let ((.cse2 (store (store (select .cse1 |v_ULTIMATE.start_ldv_zalloc_#t~malloc35.base_37|) (bvadd (_ bv224 64) ULTIMATE.start_ldv_alloc_skb_12_~tmp~12.offset) v_DerPreprocessor_5) (bvadd (_ bv232 64) ULTIMATE.start_ldv_alloc_skb_12_~tmp~12.offset) v_DerPreprocessor_4)) (.cse3 (bvadd (_ bv216 64) v_ULTIMATE.start_skb_put_~arg0.offset_9))) (store .cse2 .cse3 (bvadd (select .cse2 .cse3) v_ULTIMATE.start_skb_put_~arg1_9))))) c_ULTIMATE.start_cx82310_rx_fixup_~dev.base))) (concat (select .cse0 (bvadd (_ bv464 64) c_ULTIMATE.start_cx82310_rx_fixup_~dev.offset)) (select .cse0 (bvadd c_ULTIMATE.start_cx82310_rx_fixup_~dev.offset (_ bv460 64)))))))) is different from false [2021-11-06 14:46:56,828 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_6 (_ BitVec 32)) (v_DerPreprocessor_5 (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32)) (v_ULTIMATE.start_skb_put_~arg0.offset_9 (_ BitVec 64)) (v_ULTIMATE.start_cx82310_rx_fixup_~dev.offset_25 (_ BitVec 64)) (~last_index~0 (_ BitVec 32)) (v_ULTIMATE.start_skb_put_~arg1_9 (_ BitVec 32)) (ULTIMATE.start_ldv_alloc_skb_12_~tmp~12.offset (_ BitVec 64)) (|~#set_impl~0.offset| (_ BitVec 64)) (|v_ULTIMATE.start_ldv_zalloc_#t~malloc35.base_37| (_ BitVec 64))) (let ((.cse1 (bvadd (_ bv464 64) v_ULTIMATE.start_cx82310_rx_fixup_~dev.offset_25)) (.cse2 (bvadd (_ bv460 64) v_ULTIMATE.start_cx82310_rx_fixup_~dev.offset_25))) (or (= (_ bv0 64) (let ((.cse0 (select |c_#memory_int| c_~cx82310_info_group0~0.base))) (concat (select .cse0 .cse1) (select .cse0 .cse2)))) (= (_ bv0 64) |v_ULTIMATE.start_ldv_zalloc_#t~malloc35.base_37|) (bvult (_ bv0 64) (let ((.cse3 (select (let ((.cse4 (let ((.cse7 (store |c_#memory_int| |v_ULTIMATE.start_ldv_zalloc_#t~malloc35.base_37| ((as const (Array (_ BitVec 64) (_ BitVec 32))) (_ bv0 32))))) (store .cse7 |c_~#set_impl~0.base| (store (select .cse7 |c_~#set_impl~0.base|) (bvadd |~#set_impl~0.offset| (bvmul ((_ sign_extend 32) ~last_index~0) (_ bv8 64))) v_DerPreprocessor_6))))) (store .cse4 |v_ULTIMATE.start_ldv_zalloc_#t~malloc35.base_37| (let ((.cse5 (store (store (select .cse4 |v_ULTIMATE.start_ldv_zalloc_#t~malloc35.base_37|) (bvadd (_ bv224 64) ULTIMATE.start_ldv_alloc_skb_12_~tmp~12.offset) v_DerPreprocessor_5) (bvadd (_ bv232 64) ULTIMATE.start_ldv_alloc_skb_12_~tmp~12.offset) v_DerPreprocessor_4)) (.cse6 (bvadd (_ bv216 64) v_ULTIMATE.start_skb_put_~arg0.offset_9))) (store .cse5 .cse6 (bvadd (select .cse5 .cse6) v_ULTIMATE.start_skb_put_~arg1_9))))) c_~cx82310_info_group0~0.base))) (concat (select .cse3 .cse1) (select .cse3 .cse2))))))) is different from false [2021-11-06 14:47:07,168 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_6 (_ BitVec 32)) (v_DerPreprocessor_5 (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32)) (v_ULTIMATE.start_skb_put_~arg0.offset_9 (_ BitVec 64)) (v_ULTIMATE.start_cx82310_rx_fixup_~dev.offset_25 (_ BitVec 64)) (~last_index~0 (_ BitVec 32)) (v_ULTIMATE.start_skb_put_~arg1_9 (_ BitVec 32)) (ULTIMATE.start_ldv_alloc_skb_12_~tmp~12.offset (_ BitVec 64)) (|~#set_impl~0.offset| (_ BitVec 64)) (|v_ULTIMATE.start_ldv_zalloc_#t~malloc35.base_37| (_ BitVec 64))) (let ((.cse1 (bvadd (_ bv464 64) v_ULTIMATE.start_cx82310_rx_fixup_~dev.offset_25)) (.cse2 (bvadd (_ bv460 64) v_ULTIMATE.start_cx82310_rx_fixup_~dev.offset_25))) (or (bvult (_ bv0 64) (let ((.cse0 (select (let ((.cse3 (let ((.cse6 (store |c_#memory_int| |v_ULTIMATE.start_ldv_zalloc_#t~malloc35.base_37| ((as const (Array (_ BitVec 64) (_ BitVec 32))) (_ bv0 32))))) (store .cse6 |c_~#set_impl~0.base| (store (select .cse6 |c_~#set_impl~0.base|) (bvadd |~#set_impl~0.offset| (bvmul ((_ sign_extend 32) ~last_index~0) (_ bv8 64))) v_DerPreprocessor_6))))) (store .cse3 |v_ULTIMATE.start_ldv_zalloc_#t~malloc35.base_37| (let ((.cse4 (store (store (select .cse3 |v_ULTIMATE.start_ldv_zalloc_#t~malloc35.base_37|) (bvadd (_ bv224 64) ULTIMATE.start_ldv_alloc_skb_12_~tmp~12.offset) v_DerPreprocessor_5) (bvadd (_ bv232 64) ULTIMATE.start_ldv_alloc_skb_12_~tmp~12.offset) v_DerPreprocessor_4)) (.cse5 (bvadd (_ bv216 64) v_ULTIMATE.start_skb_put_~arg0.offset_9))) (store .cse4 .cse5 (bvadd (select .cse4 .cse5) v_ULTIMATE.start_skb_put_~arg1_9))))) |c_ULTIMATE.start_ldv_zalloc_#res.base|))) (concat (select .cse0 .cse1) (select .cse0 .cse2)))) (= (_ bv0 64) |v_ULTIMATE.start_ldv_zalloc_#t~malloc35.base_37|) (= (let ((.cse7 (select |c_#memory_int| |c_ULTIMATE.start_ldv_zalloc_#res.base|))) (concat (select .cse7 .cse1) (select .cse7 .cse2))) (_ bv0 64))))) is different from false [2021-11-06 14:47:31,348 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 14:47:31,348 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1000148790] [2021-11-06 14:47:31,349 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Index 1 out of bounds for length 1 [2021-11-06 14:47:31,349 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1726854690] [2021-11-06 14:47:31,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 14:47:31,349 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-11-06 14:47:31,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-11-06 14:47:31,350 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-11-06 14:47:31,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Waiting until timeout for monitored process [2021-11-06 14:47:32,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 14:47:32,599 INFO L263 TraceCheckSpWp]: Trace formula consists of 628 conjuncts, 30 conjunts are in the unsatisfiable core [2021-11-06 14:47:32,601 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@196d433d [2021-11-06 14:47:32,601 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1906183186] [2021-11-06 14:47:32,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 14:47:32,601 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 14:47:32,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 14:47:32,602 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-06 14:47:32,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-11-06 14:47:33,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 14:47:33,224 INFO L263 TraceCheckSpWp]: Trace formula consists of 628 conjuncts, 30 conjunts are in the unsatisfiable core [2021-11-06 14:47:33,225 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@196d433d [2021-11-06 14:47:33,225 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 0 imperfect interpolant sequences. [2021-11-06 14:47:33,225 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2021-11-06 14:47:33,225 ERROR L172 FreeRefinementEngine]: Strategy WOLF failed to provide any proof altough trace is infeasible [2021-11-06 14:47:33,225 INFO L627 BasicCegarLoop]: Counterexample might be feasible [2021-11-06 14:47:33,230 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 14:47:33,258 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-11-06 14:47:33,451 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 14:47:33,641 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Forceful destruction successful, exit code 0 [2021-11-06 14:47:33,831 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2021-11-06 14:47:33,834 INFO L731 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 14:47:33,836 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-06 14:47:33,856 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 02:47:33 BoogieIcfgContainer [2021-11-06 14:47:33,856 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-06 14:47:33,857 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-06 14:47:33,857 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-06 14:47:33,857 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-06 14:47:33,857 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 02:43:06" (3/4) ... [2021-11-06 14:47:33,859 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-11-06 14:47:33,859 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-06 14:47:33,860 INFO L168 Benchmark]: Toolchain (without parser) took 277965.19 ms. Allocated memory was 69.2 MB in the beginning and 398.5 MB in the end (delta: 329.3 MB). Free memory was 43.7 MB in the beginning and 222.3 MB in the end (delta: -178.5 MB). Peak memory consumption was 149.1 MB. Max. memory is 16.1 GB. [2021-11-06 14:47:33,860 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 69.2 MB. Free memory was 51.5 MB in the beginning and 51.5 MB in the end (delta: 62.8 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-11-06 14:47:33,861 INFO L168 Benchmark]: CACSL2BoogieTranslator took 923.21 ms. Allocated memory was 69.2 MB in the beginning and 98.6 MB in the end (delta: 29.4 MB). Free memory was 43.5 MB in the beginning and 40.6 MB in the end (delta: 2.9 MB). Peak memory consumption was 37.2 MB. Max. memory is 16.1 GB. [2021-11-06 14:47:33,861 INFO L168 Benchmark]: Boogie Procedure Inliner took 137.28 ms. Allocated memory is still 98.6 MB. Free memory was 40.5 MB in the beginning and 46.7 MB in the end (delta: -6.1 MB). Peak memory consumption was 7.7 MB. Max. memory is 16.1 GB. [2021-11-06 14:47:33,861 INFO L168 Benchmark]: Boogie Preprocessor took 139.20 ms. Allocated memory was 98.6 MB in the beginning and 159.4 MB in the end (delta: 60.8 MB). Free memory was 46.7 MB in the beginning and 107.8 MB in the end (delta: -61.1 MB). Peak memory consumption was 19.4 MB. Max. memory is 16.1 GB. [2021-11-06 14:47:33,861 INFO L168 Benchmark]: RCFGBuilder took 9754.16 ms. Allocated memory was 159.4 MB in the beginning and 203.4 MB in the end (delta: 44.0 MB). Free memory was 107.8 MB in the beginning and 84.9 MB in the end (delta: 22.8 MB). Peak memory consumption was 84.7 MB. Max. memory is 16.1 GB. [2021-11-06 14:47:33,862 INFO L168 Benchmark]: TraceAbstraction took 267004.10 ms. Allocated memory was 203.4 MB in the beginning and 398.5 MB in the end (delta: 195.0 MB). Free memory was 84.9 MB in the beginning and 222.3 MB in the end (delta: -137.3 MB). Peak memory consumption was 56.6 MB. Max. memory is 16.1 GB. [2021-11-06 14:47:33,862 INFO L168 Benchmark]: Witness Printer took 2.74 ms. Allocated memory is still 398.5 MB. Free memory is still 222.3 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-11-06 14:47:33,863 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.17 ms. Allocated memory is still 69.2 MB. Free memory was 51.5 MB in the beginning and 51.5 MB in the end (delta: 62.8 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 923.21 ms. Allocated memory was 69.2 MB in the beginning and 98.6 MB in the end (delta: 29.4 MB). Free memory was 43.5 MB in the beginning and 40.6 MB in the end (delta: 2.9 MB). Peak memory consumption was 37.2 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 137.28 ms. Allocated memory is still 98.6 MB. Free memory was 40.5 MB in the beginning and 46.7 MB in the end (delta: -6.1 MB). Peak memory consumption was 7.7 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 139.20 ms. Allocated memory was 98.6 MB in the beginning and 159.4 MB in the end (delta: 60.8 MB). Free memory was 46.7 MB in the beginning and 107.8 MB in the end (delta: -61.1 MB). Peak memory consumption was 19.4 MB. Max. memory is 16.1 GB. * RCFGBuilder took 9754.16 ms. Allocated memory was 159.4 MB in the beginning and 203.4 MB in the end (delta: 44.0 MB). Free memory was 107.8 MB in the beginning and 84.9 MB in the end (delta: 22.8 MB). Peak memory consumption was 84.7 MB. Max. memory is 16.1 GB. * TraceAbstraction took 267004.10 ms. Allocated memory was 203.4 MB in the beginning and 398.5 MB in the end (delta: 195.0 MB). Free memory was 84.9 MB in the beginning and 222.3 MB in the end (delta: -137.3 MB). Peak memory consumption was 56.6 MB. Max. memory is 16.1 GB. * Witness Printer took 2.74 ms. Allocated memory is still 398.5 MB. Free memory is still 222.3 MB. 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: 5569]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: unable to decide satisfiability of path constraint, overapproximation of large string literal at line 5927. Possible FailurePath: [L5592] struct sk_buff *cx82310_info_group2 ; [L5593] int LDV_IN_INTERRUPT = 1; [L5594] int ldv_state_variable_2 ; [L5595] int ref_cnt ; [L5596] struct usbnet *cx82310_info_group0 ; [L5597] int ldv_state_variable_1 ; [L5598] int usb_counter ; [L5599] struct usb_interface *cx82310_info_group1 ; [L5600] struct usb_interface *cx82310_driver_group1 ; [L5601] int ldv_state_variable_0 ; [L5907-L5909] static struct driver_info const cx82310_info = {(char *)"Conexant CX82310 USB ethernet", 32, & cx82310_bind, & cx82310_unbind, 0, 0, 0, 0, 0, 0, & cx82310_rx_fixup, & cx82310_tx_fixup, 0, 0, 0, 0, 0UL}; [L5910-L5911] static struct usb_device_id const products[2U] = { {899U, 1394U, 51969U, (unsigned short)0, (unsigned short)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, 255U, 0U, 0U, (unsigned char)0, (unsigned long )(& cx82310_info)}}; [L5912] struct usb_device_id const __mod_usb__products_device_table ; [L5913-L5922] static struct usb_driver cx82310_driver = {"cx82310_eth", & usbnet_probe, & usbnet_disconnect, 0, & usbnet_suspend, & usbnet_resume, 0, 0, 0, (struct usb_device_id const *)(& products), {{{{{{0U}}, 0U, 0U, 0, {0, {0, 0}, 0, 0, 0UL}}}}, {0, 0}}, {{0, 0, 0, 0, (_Bool)0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, 0}, (unsigned char)0, (unsigned char)0, 1U, (unsigned char)0}; [L5939] int ldv_retval_2 ; [L5940] int ldv_retval_0 ; [L5941] int ldv_retval_5 ; [L5942] int ldv_retval_4 ; [L5944] int ldv_retval_1 ; [L5946] int ldv_retval_3 ; [L6231] Element set_impl[15] ; [L6232] int last_index = 0; [L6366] Set LDV_SKBS ; [L5973] struct usb_device_id *ldvarg1 ; [L5974] void *tmp ; [L5975] pm_message_t ldvarg0 ; [L5976] gfp_t ldvarg2 ; [L5977] int tmp___0 ; [L5978] int tmp___1 ; [L5979] int tmp___2 ; [L5980] int tmp___3 ; [L5534] void *p ; [L5535] void *tmp ; [L5536] int tmp___0 ; [L5538] tmp___0 = __VERIFIER_nondet_int() [L5539] COND TRUE tmp___0 != 0 [L5540] return ((void *)0); [L5982] tmp = ldv_zalloc(32UL) [L5983] ldvarg1 = (struct usb_device_id *)tmp [L6237] set = set_impl [L6238] last_index = 0 [L5987] ldv_state_variable_1 = 0 [L5988] ref_cnt = 0 [L5989] ldv_state_variable_0 = 1 [L5990] ldv_state_variable_2 = 0 [L5992] tmp___0 = __VERIFIER_nondet_int() [L5994] case 0: [L6060] case 1: [L6061] COND TRUE ldv_state_variable_0 != 0 [L6062] tmp___2 = __VERIFIER_nondet_int() [L6064] case 0: [L6072] case 1: [L6073] COND TRUE ldv_state_variable_0 == 1 [L5925] int tmp ; [L5927] CALL, EXPR ldv_usb_register_driver_14(& cx82310_driver, & __this_module, "cx82310_eth") [L6211] ldv_func_ret_type ldv_func_res ; [L6212] int tmp ; [L6487] return __VERIFIER_nondet_int(); [L6214] tmp = usb_register_driver(ldv_func_arg1, ldv_func_arg2, ldv_func_arg3) [L6215] ldv_func_res = tmp [L6216] ldv_state_variable_1 = 1 [L6217] usb_counter = 0 [L5964] void *tmp ; [L5534] void *p ; [L5535] void *tmp ; [L5536] int tmp___0 ; [L5538] tmp___0 = __VERIFIER_nondet_int() [L5539] COND TRUE tmp___0 != 0 [L5540] return ((void *)0); [L5966] tmp = ldv_zalloc(1560UL) [L5967] cx82310_driver_group1 = (struct usb_interface *)tmp [L6219] return (ldv_func_res); [L5927] tmp = ldv_usb_register_driver_14(& cx82310_driver, & __this_module, "cx82310_eth") [L5928] return (tmp); [L6074] ldv_retval_4 = cx82310_driver_init() [L6075] COND TRUE ldv_retval_4 == 0 [L6076] ldv_state_variable_0 = 3 [L6077] ldv_state_variable_2 = 1 [L5949] void *tmp ; [L5950] void *tmp___0 ; [L5951] void *tmp___1 ; [L5534] void *p ; [L5535] void *tmp ; [L5536] int tmp___0 ; [L5538] tmp___0 = __VERIFIER_nondet_int() [L5539] COND TRUE tmp___0 != 0 [L5540] return ((void *)0); [L5953] tmp = ldv_zalloc(1472UL) [L5954] cx82310_info_group0 = (struct usbnet *)tmp [L5534] void *p ; [L5535] void *tmp ; [L5536] int tmp___0 ; [L5538] tmp___0 = __VERIFIER_nondet_int() [L5539] COND TRUE tmp___0 != 0 [L5540] return ((void *)0); [L5955] tmp___0 = ldv_zalloc(1560UL) [L5956] cx82310_info_group1 = (struct usb_interface *)tmp___0 [L5534] void *p ; [L5535] void *tmp ; [L5536] int tmp___0 ; [L5538] tmp___0 = __VERIFIER_nondet_int() [L5539] COND TRUE tmp___0 != 0 [L5540] return ((void *)0); [L5957] tmp___1 = ldv_zalloc(232UL) [L5958] cx82310_info_group2 = (struct sk_buff *)tmp___1 [L6081] COND FALSE !(ldv_retval_4 != 0) [L5992] tmp___0 = __VERIFIER_nondet_int() [L5994] case 0: [L6060] case 1: [L6096] case 2: [L6097] COND TRUE ldv_state_variable_2 != 0 [L6098] tmp___3 = __VERIFIER_nondet_int() [L6100] case 0: [L6101] COND TRUE ldv_state_variable_2 == 1 [L5803] int len ; [L5804] struct sk_buff *skb2 ; [L5805] size_t __len ; [L5806] void *__ret ; [L5807] size_t __len___0 ; [L5808] void *__ret___0 ; [L5809] size_t __len___1 ; [L5810] void *__ret___1 ; [L5811] size_t __len___2 ; [L5812] void *__ret___2 ; [L5814] EXPR dev->data[1] [L5814] COND TRUE dev->data[1] != 0UL [L5815] EXPR dev->data[0] [L5815] EXPR dev->data[1] [L5815] len = (int )((unsigned int )dev->data[0] + (unsigned int )dev->data[1]) [L6197] struct sk_buff *tmp ; [L6369] void *skb ; [L6370] void *tmp___7 ; [L5534] void *p ; [L5535] void *tmp ; [L5536] int tmp___0 ; [L5538] tmp___0 = __VERIFIER_nondet_int() [L5539] COND FALSE !(tmp___0 != 0) [L5542] tmp = calloc(1UL, size) [L5543] p = tmp [L5513] COND FALSE !(!cond) [L5545] return (p); [L6372] tmp___7 = ldv_zalloc(sizeof(struct sk_buff___0 )) [L6373] skb = (struct sk_buff___0 *)tmp___7 [L6374] COND FALSE !(! skb) [L6245] int i ; [L6247] i = 0 [L6248] COND TRUE 1 [L6249] COND FALSE !(i < last_index) [L6259] COND TRUE last_index < 15 [L6260] set_impl[last_index] = e [L6261] last_index = last_index + 1 [L6378] return (skb); [L6199] tmp = ldv_skb_alloc() [L6200] COND TRUE \read(*tmp) [L5517] void *p ; [L5518] void *tmp ; [L5519] int tmp___0 ; [L5521] tmp___0 = __VERIFIER_nondet_int() [L5522] COND TRUE tmp___0 != 0 [L5523] return ((void *)0); [L6202] tmp->head = ldv_malloc(size) [L6203] EXPR tmp->head [L6203] tmp->data = tmp->head [L6205] return (tmp); [L5816] skb2 = ldv_alloc_skb_12((unsigned int )len, 32U) [L5817] COND FALSE !((unsigned long )skb2 == (unsigned long )((struct sk_buff *)0)) [L6471] EXPR arg0->data [L6471] EXPR arg0->tail [L6471] unsigned char *ret_val = arg0->data + arg0->tail; [L6472] EXPR arg0->tail [L6472] arg0->tail += arg1 [L6473] return ret_val; [L5822] EXPR dev->data[0] [L5822] __len = dev->data[0] [L5823] EXPR skb2->data [L5823] EXPR dev->data[2] [L5823] __ret = memcpy((void *)skb2->data, (void const *)dev->data[2], __len) [L5824] EXPR dev->data[1] [L5824] __len___0 = dev->data[1] [L5825] EXPR skb2->data [L5825] EXPR dev->data[0] [L5825] EXPR skb->data [L5825-L5826] __ret___0 = memcpy((void *)(skb2->data + dev->data[0]), (void const *)skb->data, __len___0) [L5828] dev->data[1] [L5517] void *p ; [L5518] void *tmp ; [L5519] int tmp___0 ; [L5521] tmp___0 = __VERIFIER_nondet_int() [L5522] COND TRUE tmp___0 != 0 [L5523] return ((void *)0); [L6465] return ldv_malloc(sizeof(unsigned char)); [L5829] dev->data[1] = 0UL [L5830] EXPR skb->len [L5830] COND TRUE skb->len <= 1U [L5831] return (1); [L6103] ldv_state_variable_2 = 1 [L6106] COND FALSE !(ldv_state_variable_2 == 2) [L5992] tmp___0 = __VERIFIER_nondet_int() [L5994] case 0: [L6060] case 1: [L6061] COND TRUE ldv_state_variable_0 != 0 [L6062] tmp___2 = __VERIFIER_nondet_int() [L6064] case 0: [L6065] COND TRUE ldv_state_variable_0 == 3 && ref_cnt == 0 [L6226] ldv_state_variable_1 = 0 [L6067] ldv_state_variable_0 = 2 [L6436] int tmp___7 ; [L6327] return (last_index == 0); [L6438] tmp___7 = ldv_set_is_empty(LDV_SKBS) [L6439] COND FALSE !(\read(tmp___7)) [L5569] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 449 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 266.9s, OverallIterations: 10, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 23.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 8374 SDtfs, 21652 SDslu, 38228 SDs, 0 SdLazy, 2009 SolverSat, 157 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 15.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 959 GetRequests, 881 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 7.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3255occurred in iteration=9, InterpolantAutomatonStates: 72, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 9 MinimizatonAttempts, 29921 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 3.9s SatisfiabilityAnalysisTime, 232.1s InterpolantComputationTime, 554 NumberOfCodeBlocks, 546 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1000 ConstructedInterpolants, 45 QuantifiedInterpolants, 3185 SizeOfPredicates, 67 NumberOfNonLiveVariables, 4681 ConjunctsInSsa, 86 ConjunctsInUnsatCore, 19 InterpolantComputations, 17 PerfectInterpolantSequences, 411/417 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 14:47:33,947 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN