./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 5f08f0f0 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-wip.dd.seqcomp-5f08f0f [2021-11-05 16:41:41,491 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-05 16:41:41,493 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-05 16:41:41,536 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-05 16:41:41,536 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-05 16:41:41,539 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-05 16:41:41,540 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-05 16:41:41,544 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-05 16:41:41,546 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-05 16:41:41,551 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-05 16:41:41,553 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-05 16:41:41,554 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-05 16:41:41,554 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-05 16:41:41,556 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-05 16:41:41,557 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-05 16:41:41,563 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-05 16:41:41,565 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-05 16:41:41,566 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-05 16:41:41,567 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-05 16:41:41,570 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-05 16:41:41,572 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-05 16:41:41,573 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-05 16:41:41,574 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-05 16:41:41,575 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-05 16:41:41,579 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-05 16:41:41,582 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-05 16:41:41,582 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-05 16:41:41,583 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-05 16:41:41,584 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-05 16:41:41,585 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-05 16:41:41,585 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-05 16:41:41,585 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-05 16:41:41,586 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-05 16:41:41,587 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-05 16:41:41,588 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-05 16:41:41,588 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-05 16:41:41,589 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-05 16:41:41,589 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-05 16:41:41,589 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-05 16:41:41,590 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-05 16:41:41,591 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-05 16:41:41,593 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-05 16:41:41,616 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-05 16:41:41,616 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-05 16:41:41,617 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-05 16:41:41,617 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-05 16:41:41,619 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-05 16:41:41,619 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-05 16:41:41,619 INFO L138 SettingsManager]: * Use SBE=true [2021-11-05 16:41:41,619 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-05 16:41:41,619 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-05 16:41:41,620 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-05 16:41:41,620 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-05 16:41:41,620 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-05 16:41:41,620 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-05 16:41:41,621 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-05 16:41:41,621 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-05 16:41:41,621 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-05 16:41:41,621 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-05 16:41:41,621 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-05 16:41:41,621 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-05 16:41:41,622 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-05 16:41:41,622 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-05 16:41:41,622 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-05 16:41:41,622 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-05 16:41:41,622 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-05 16:41:41,622 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-05 16:41:41,622 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-05 16:41:41,623 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-05 16:41:41,623 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-05 16:41:41,623 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-05 16:41:41,623 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-05 16:41:41,972 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-05 16:41:41,990 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-05 16:41:41,993 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-05 16:41:41,994 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-05 16:41:41,995 INFO L275 PluginConnector]: CDTParser initialized [2021-11-05 16:41:41,996 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-05 16:41:42,046 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53e042511/cc4ff46d1826410a8e318b543ea1ec04/FLAGbdd4a98ce [2021-11-05 16:41:42,692 INFO L306 CDTParser]: Found 1 translation units. [2021-11-05 16:41:42,692 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-05 16:41:42,722 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53e042511/cc4ff46d1826410a8e318b543ea1ec04/FLAGbdd4a98ce [2021-11-05 16:41:43,039 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53e042511/cc4ff46d1826410a8e318b543ea1ec04 [2021-11-05 16:41:43,050 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-05 16:41:43,051 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-05 16:41:43,051 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-05 16:41:43,052 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-05 16:41:43,056 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-05 16:41:43,057 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 04:41:43" (1/1) ... [2021-11-05 16:41:43,057 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@682f4e8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 04:41:43, skipping insertion in model container [2021-11-05 16:41:43,058 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 04:41:43" (1/1) ... [2021-11-05 16:41:43,063 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-05 16:41:43,176 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-05 16:41:43,684 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-05 16:41:43,822 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-05 16:41:43,866 INFO L203 MainTranslator]: Completed pre-run [2021-11-05 16:41:43,943 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-05 16:41:43,993 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-05 16:41:44,023 INFO L208 MainTranslator]: Completed translation [2021-11-05 16:41:44,023 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 04:41:44 WrapperNode [2021-11-05 16:41:44,024 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-05 16:41:44,025 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-05 16:41:44,026 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-05 16:41:44,026 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-05 16:41:44,031 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 04:41:44" (1/1) ... [2021-11-05 16:41:44,066 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 04:41:44" (1/1) ... [2021-11-05 16:41:44,147 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-05 16:41:44,148 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-05 16:41:44,148 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-05 16:41:44,149 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-05 16:41:44,154 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 04:41:44" (1/1) ... [2021-11-05 16:41:44,155 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 04:41:44" (1/1) ... [2021-11-05 16:41:44,179 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 04:41:44" (1/1) ... [2021-11-05 16:41:44,183 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 04:41:44" (1/1) ... [2021-11-05 16:41:44,242 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 04:41:44" (1/1) ... [2021-11-05 16:41:44,266 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 04:41:44" (1/1) ... [2021-11-05 16:41:44,277 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 04:41:44" (1/1) ... [2021-11-05 16:41:44,297 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-05 16:41:44,298 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-05 16:41:44,299 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-05 16:41:44,299 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-05 16:41:44,299 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 04:41:44" (1/1) ... [2021-11-05 16:41:44,304 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-05 16:41:44,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-05 16:41:44,347 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-05 16:41:44,377 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-05 16:41:44,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2021-11-05 16:41:44,390 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2021-11-05 16:41:44,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2021-11-05 16:41:44,390 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-05 16:41:44,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-05 16:41:44,390 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-05 16:41:44,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-05 16:41:44,391 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-05 16:41:44,391 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-05 16:41:44,391 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-05 16:41:44,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-05 16:41:44,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-05 16:41:44,391 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2021-11-05 16:41:44,391 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-05 16:41:44,391 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-05 16:41:46,763 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-05 16:41:46,763 INFO L299 CfgBuilder]: Removed 377 assume(true) statements. [2021-11-05 16:41:46,765 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 04:41:46 BoogieIcfgContainer [2021-11-05 16:41:46,766 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-05 16:41:46,767 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-05 16:41:46,767 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-05 16:41:46,769 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-05 16:41:46,769 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.11 04:41:43" (1/3) ... [2021-11-05 16:41:46,769 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52928419 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 04:41:46, skipping insertion in model container [2021-11-05 16:41:46,770 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 04:41:44" (2/3) ... [2021-11-05 16:41:46,770 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52928419 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 04:41:46, skipping insertion in model container [2021-11-05 16:41:46,770 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 04:41:46" (3/3) ... [2021-11-05 16:41:46,771 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-05 16:41:46,774 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-05 16:41:46,775 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-05 16:41:46,806 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-05 16:41:46,811 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-05 16:41:46,811 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-05 16:41:46,826 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-05 16:41:46,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-11-05 16:41:46,832 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 16:41:46,833 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 16:41:46,833 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-05 16:41:46,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 16:41:46,837 INFO L85 PathProgramCache]: Analyzing trace with hash 1795372011, now seen corresponding path program 1 times [2021-11-05 16:41:46,843 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 16:41:46,843 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990471917] [2021-11-05 16:41:46,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 16:41:46,844 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 16:41:46,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 16:41:47,086 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-05 16:41:47,087 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 16:41:47,087 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990471917] [2021-11-05 16:41:47,087 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990471917] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 16:41:47,087 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 16:41:47,088 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-05 16:41:47,089 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446914097] [2021-11-05 16:41:47,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 16:41:47,092 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-05 16:41:47,092 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 16:41:47,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-05 16:41:47,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-05 16:41:47,111 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-05 16:41:47,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 16:41:47,366 INFO L93 Difference]: Finished difference Result 1294 states and 1957 transitions. [2021-11-05 16:41:47,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-05 16:41:47,369 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-05 16:41:47,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 16:41:47,381 INFO L225 Difference]: With dead ends: 1294 [2021-11-05 16:41:47,382 INFO L226 Difference]: Without dead ends: 838 [2021-11-05 16:41:47,386 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.08ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-05 16:41:47,388 INFO L933 BasicCegarLoop]: 634 mSDtfsCounter, 584 mSDsluCounter, 615 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 181.31ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 584 SdHoareTripleChecker+Valid, 1249 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.65ms SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 192.68ms IncrementalHoareTripleChecker+Time [2021-11-05 16:41:47,389 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [584 Valid, 1249 Invalid, 15 Unknown, 0 Unchecked, 6.65ms Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 192.68ms Time] [2021-11-05 16:41:47,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2021-11-05 16:41:47,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 838. [2021-11-05 16:41:47,477 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-05 16:41:47,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1196 transitions. [2021-11-05 16:41:47,481 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1196 transitions. Word has length 21 [2021-11-05 16:41:47,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 16:41:47,481 INFO L470 AbstractCegarLoop]: Abstraction has 838 states and 1196 transitions. [2021-11-05 16:41:47,481 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-05 16:41:47,482 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1196 transitions. [2021-11-05 16:41:47,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-05 16:41:47,483 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 16:41:47,483 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 16:41:47,484 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-05 16:41:47,484 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-05 16:41:47,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 16:41:47,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1377357218, now seen corresponding path program 1 times [2021-11-05 16:41:47,485 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 16:41:47,485 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151124316] [2021-11-05 16:41:47,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 16:41:47,485 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 16:41:47,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 16:41:47,611 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-05 16:41:47,612 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 16:41:47,612 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151124316] [2021-11-05 16:41:47,612 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151124316] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 16:41:47,612 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 16:41:47,612 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-05 16:41:47,613 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901144104] [2021-11-05 16:41:47,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 16:41:47,614 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-05 16:41:47,615 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 16:41:47,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-05 16:41:47,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-05 16:41:47,616 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-05 16:41:47,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 16:41:47,710 INFO L93 Difference]: Finished difference Result 2488 states and 3557 transitions. [2021-11-05 16:41:47,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-05 16:41:47,711 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-05 16:41:47,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 16:41:47,715 INFO L225 Difference]: With dead ends: 2488 [2021-11-05 16:41:47,716 INFO L226 Difference]: Without dead ends: 1657 [2021-11-05 16:41:47,717 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.23ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-05 16:41:47,718 INFO L933 BasicCegarLoop]: 615 mSDtfsCounter, 594 mSDsluCounter, 1822 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 44.00ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 594 SdHoareTripleChecker+Valid, 2437 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.11ms SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 53.33ms IncrementalHoareTripleChecker+Time [2021-11-05 16:41:47,719 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [594 Valid, 2437 Invalid, 65 Unknown, 0 Unchecked, 3.11ms Time], IncrementalHoareTripleChecker [5 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 53.33ms Time] [2021-11-05 16:41:47,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1657 states. [2021-11-05 16:41:47,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1657 to 1657. [2021-11-05 16:41:47,749 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-05 16:41:47,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1657 states to 1657 states and 2360 transitions. [2021-11-05 16:41:47,753 INFO L78 Accepts]: Start accepts. Automaton has 1657 states and 2360 transitions. Word has length 28 [2021-11-05 16:41:47,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 16:41:47,754 INFO L470 AbstractCegarLoop]: Abstraction has 1657 states and 2360 transitions. [2021-11-05 16:41:47,754 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-05 16:41:47,754 INFO L276 IsEmpty]: Start isEmpty. Operand 1657 states and 2360 transitions. [2021-11-05 16:41:47,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-11-05 16:41:47,757 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 16:41:47,758 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 16:41:47,758 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-05 16:41:47,758 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-05 16:41:47,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 16:41:47,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1834683196, now seen corresponding path program 1 times [2021-11-05 16:41:47,759 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 16:41:47,759 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782497372] [2021-11-05 16:41:47,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 16:41:47,759 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 16:41:47,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 16:41:47,813 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-05 16:41:47,814 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 16:41:47,814 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782497372] [2021-11-05 16:41:47,814 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782497372] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 16:41:47,814 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 16:41:47,814 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-05 16:41:47,815 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462598150] [2021-11-05 16:41:47,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 16:41:47,815 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-05 16:41:47,815 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 16:41:47,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-05 16:41:47,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-05 16:41:47,816 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-05 16:41:47,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 16:41:47,875 INFO L93 Difference]: Finished difference Result 3483 states and 4983 transitions. [2021-11-05 16:41:47,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-05 16:41:47,875 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-05 16:41:47,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 16:41:47,881 INFO L225 Difference]: With dead ends: 3483 [2021-11-05 16:41:47,881 INFO L226 Difference]: Without dead ends: 1838 [2021-11-05 16:41:47,883 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.41ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-05 16:41:47,883 INFO L933 BasicCegarLoop]: 634 mSDtfsCounter, 90 mSDsluCounter, 589 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.32ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 1223 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.23ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 28.77ms IncrementalHoareTripleChecker+Time [2021-11-05 16:41:47,884 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [90 Valid, 1223 Invalid, 23 Unknown, 0 Unchecked, 1.23ms Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 28.77ms Time] [2021-11-05 16:41:47,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2021-11-05 16:41:47,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1831. [2021-11-05 16:41:47,946 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-05 16:41:47,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1831 states to 1831 states and 2628 transitions. [2021-11-05 16:41:47,950 INFO L78 Accepts]: Start accepts. Automaton has 1831 states and 2628 transitions. Word has length 50 [2021-11-05 16:41:47,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 16:41:47,951 INFO L470 AbstractCegarLoop]: Abstraction has 1831 states and 2628 transitions. [2021-11-05 16:41:47,951 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-05 16:41:47,951 INFO L276 IsEmpty]: Start isEmpty. Operand 1831 states and 2628 transitions. [2021-11-05 16:41:47,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-11-05 16:41:47,953 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 16:41:47,953 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 16:41:47,953 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-05 16:41:47,954 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-05 16:41:47,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 16:41:47,954 INFO L85 PathProgramCache]: Analyzing trace with hash 1294035092, now seen corresponding path program 1 times [2021-11-05 16:41:47,954 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 16:41:47,955 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242607047] [2021-11-05 16:41:47,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 16:41:47,955 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 16:41:47,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 16:41:48,022 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-05 16:41:48,022 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 16:41:48,023 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242607047] [2021-11-05 16:41:48,023 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242607047] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 16:41:48,023 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 16:41:48,023 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-05 16:41:48,023 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135984144] [2021-11-05 16:41:48,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 16:41:48,024 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-05 16:41:48,024 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 16:41:48,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-05 16:41:48,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-05 16:41:48,025 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-05 16:41:48,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 16:41:48,332 INFO L93 Difference]: Finished difference Result 3879 states and 5607 transitions. [2021-11-05 16:41:48,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-05 16:41:48,333 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-05 16:41:48,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 16:41:48,339 INFO L225 Difference]: With dead ends: 3879 [2021-11-05 16:41:48,339 INFO L226 Difference]: Without dead ends: 2060 [2021-11-05 16:41:48,342 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.54ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-05 16:41:48,343 INFO L933 BasicCegarLoop]: 689 mSDtfsCounter, 440 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 251.40ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 440 SdHoareTripleChecker+Valid, 935 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.65ms SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 266.98ms IncrementalHoareTripleChecker+Time [2021-11-05 16:41:48,343 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [440 Valid, 935 Invalid, 35 Unknown, 0 Unchecked, 1.65ms Time], IncrementalHoareTripleChecker [12 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 266.98ms Time] [2021-11-05 16:41:48,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2060 states. [2021-11-05 16:41:48,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2060 to 2053. [2021-11-05 16:41:48,384 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-05 16:41:48,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2053 states to 2053 states and 2960 transitions. [2021-11-05 16:41:48,389 INFO L78 Accepts]: Start accepts. Automaton has 2053 states and 2960 transitions. Word has length 64 [2021-11-05 16:41:48,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 16:41:48,390 INFO L470 AbstractCegarLoop]: Abstraction has 2053 states and 2960 transitions. [2021-11-05 16:41:48,390 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-05 16:41:48,390 INFO L276 IsEmpty]: Start isEmpty. Operand 2053 states and 2960 transitions. [2021-11-05 16:41:48,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-11-05 16:41:48,392 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 16:41:48,392 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 16:41:48,392 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-05 16:41:48,392 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-05 16:41:48,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 16:41:48,393 INFO L85 PathProgramCache]: Analyzing trace with hash 45757330, now seen corresponding path program 1 times [2021-11-05 16:41:48,393 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 16:41:48,393 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788911804] [2021-11-05 16:41:48,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 16:41:48,393 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 16:41:48,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 16:41:48,466 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-05 16:41:48,466 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 16:41:48,466 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788911804] [2021-11-05 16:41:48,466 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788911804] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 16:41:48,467 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 16:41:48,467 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-05 16:41:48,467 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688977550] [2021-11-05 16:41:48,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 16:41:48,467 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-05 16:41:48,468 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 16:41:48,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-05 16:41:48,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-05 16:41:48,468 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-05 16:41:48,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 16:41:48,685 INFO L93 Difference]: Finished difference Result 9247 states and 13428 transitions. [2021-11-05 16:41:48,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-05 16:41:48,686 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-05 16:41:48,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 16:41:48,708 INFO L225 Difference]: With dead ends: 9247 [2021-11-05 16:41:48,708 INFO L226 Difference]: Without dead ends: 7206 [2021-11-05 16:41:48,712 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.58ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-05 16:41:48,712 INFO L933 BasicCegarLoop]: 1040 mSDtfsCounter, 1591 mSDsluCounter, 1608 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 57.46ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1591 SdHoareTripleChecker+Valid, 2648 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.36ms SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 71.33ms IncrementalHoareTripleChecker+Time [2021-11-05 16:41:48,712 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1591 Valid, 2648 Invalid, 101 Unknown, 0 Unchecked, 5.36ms Time], IncrementalHoareTripleChecker [20 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 71.33ms Time] [2021-11-05 16:41:48,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7206 states. [2021-11-05 16:41:48,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7206 to 2085. [2021-11-05 16:41:48,795 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-05 16:41:48,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2085 states to 2085 states and 2992 transitions. [2021-11-05 16:41:48,800 INFO L78 Accepts]: Start accepts. Automaton has 2085 states and 2992 transitions. Word has length 64 [2021-11-05 16:41:48,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 16:41:48,800 INFO L470 AbstractCegarLoop]: Abstraction has 2085 states and 2992 transitions. [2021-11-05 16:41:48,800 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-05 16:41:48,801 INFO L276 IsEmpty]: Start isEmpty. Operand 2085 states and 2992 transitions. [2021-11-05 16:41:48,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-11-05 16:41:48,802 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 16:41:48,802 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 16:41:48,803 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-05 16:41:48,803 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-05 16:41:48,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 16:41:48,803 INFO L85 PathProgramCache]: Analyzing trace with hash 2089538442, now seen corresponding path program 1 times [2021-11-05 16:41:48,804 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 16:41:48,804 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534360927] [2021-11-05 16:41:48,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 16:41:48,804 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 16:41:48,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 16:41:48,892 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-05 16:41:48,893 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 16:41:48,893 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534360927] [2021-11-05 16:41:48,893 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534360927] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 16:41:48,893 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 16:41:48,893 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-05 16:41:48,893 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292118642] [2021-11-05 16:41:48,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 16:41:48,894 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-05 16:41:48,894 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 16:41:48,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-05 16:41:48,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-11-05 16:41:48,895 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-05 16:41:49,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 16:41:49,679 INFO L93 Difference]: Finished difference Result 10761 states and 15626 transitions. [2021-11-05 16:41:49,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-05 16:41:49,680 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-05 16:41:49,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 16:41:49,705 INFO L225 Difference]: With dead ends: 10761 [2021-11-05 16:41:49,706 INFO L226 Difference]: Without dead ends: 8688 [2021-11-05 16:41:49,710 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 134.28ms TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2021-11-05 16:41:49,711 INFO L933 BasicCegarLoop]: 2416 mSDtfsCounter, 5178 mSDsluCounter, 9136 mSDsCounter, 0 mSdLazyCounter, 627 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 292.16ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 5178 SdHoareTripleChecker+Valid, 11552 SdHoareTripleChecker+Invalid, 683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 18.91ms SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 356.37ms IncrementalHoareTripleChecker+Time [2021-11-05 16:41:49,711 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5178 Valid, 11552 Invalid, 683 Unknown, 0 Unchecked, 18.91ms Time], IncrementalHoareTripleChecker [56 Valid, 627 Invalid, 0 Unknown, 0 Unchecked, 356.37ms Time] [2021-11-05 16:41:49,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8688 states. [2021-11-05 16:41:49,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8688 to 2117. [2021-11-05 16:41:49,816 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-05 16:41:49,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2117 states to 2117 states and 3024 transitions. [2021-11-05 16:41:49,821 INFO L78 Accepts]: Start accepts. Automaton has 2117 states and 3024 transitions. Word has length 67 [2021-11-05 16:41:49,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 16:41:49,821 INFO L470 AbstractCegarLoop]: Abstraction has 2117 states and 3024 transitions. [2021-11-05 16:41:49,821 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-05 16:41:49,822 INFO L276 IsEmpty]: Start isEmpty. Operand 2117 states and 3024 transitions. [2021-11-05 16:41:49,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-11-05 16:41:49,823 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 16:41:49,824 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 16:41:49,824 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-05 16:41:49,824 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-05 16:41:49,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 16:41:49,825 INFO L85 PathProgramCache]: Analyzing trace with hash -536003665, now seen corresponding path program 1 times [2021-11-05 16:41:49,825 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 16:41:49,825 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676716457] [2021-11-05 16:41:49,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 16:41:49,825 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 16:41:49,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 16:41:49,900 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-05 16:41:49,901 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 16:41:49,901 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676716457] [2021-11-05 16:41:49,901 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676716457] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 16:41:49,901 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 16:41:49,901 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-05 16:41:49,901 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62841828] [2021-11-05 16:41:49,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 16:41:49,902 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-05 16:41:49,902 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 16:41:49,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-05 16:41:49,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-05 16:41:49,902 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-05 16:41:49,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 16:41:49,983 INFO L93 Difference]: Finished difference Result 4227 states and 6041 transitions. [2021-11-05 16:41:49,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-05 16:41:49,984 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-05 16:41:49,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 16:41:49,990 INFO L225 Difference]: With dead ends: 4227 [2021-11-05 16:41:49,990 INFO L226 Difference]: Without dead ends: 2119 [2021-11-05 16:41:49,993 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.85ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-05 16:41:49,994 INFO L933 BasicCegarLoop]: 623 mSDtfsCounter, 0 mSDsluCounter, 619 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.29ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1242 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.30ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.44ms IncrementalHoareTripleChecker+Time [2021-11-05 16:41:49,994 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 1242 Invalid, 8 Unknown, 0 Unchecked, 1.30ms Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 7.44ms Time] [2021-11-05 16:41:49,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2119 states. [2021-11-05 16:41:50,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2119 to 2119. [2021-11-05 16:41:50,114 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-05 16:41:50,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2119 states to 2119 states and 3026 transitions. [2021-11-05 16:41:50,121 INFO L78 Accepts]: Start accepts. Automaton has 2119 states and 3026 transitions. Word has length 69 [2021-11-05 16:41:50,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 16:41:50,121 INFO L470 AbstractCegarLoop]: Abstraction has 2119 states and 3026 transitions. [2021-11-05 16:41:50,122 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-05 16:41:50,122 INFO L276 IsEmpty]: Start isEmpty. Operand 2119 states and 3026 transitions. [2021-11-05 16:41:50,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-11-05 16:41:50,124 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 16:41:50,124 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 16:41:50,124 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-05 16:41:50,125 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-05 16:41:50,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 16:41:50,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1502691923, now seen corresponding path program 1 times [2021-11-05 16:41:50,125 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 16:41:50,126 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071948212] [2021-11-05 16:41:50,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 16:41:50,126 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 16:41:50,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 16:41:50,232 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-05 16:41:50,232 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 16:41:50,233 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071948212] [2021-11-05 16:41:50,233 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071948212] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-05 16:41:50,233 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1455018626] [2021-11-05 16:41:50,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 16:41:50,233 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-05 16:41:50,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-05 16:41:50,235 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-05 16:41:50,271 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-05 16:41:50,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 16:41:50,557 INFO L263 TraceCheckSpWp]: Trace formula consists of 936 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-05 16:41:50,562 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-05 16:41:50,705 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-05 16:41:50,705 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-05 16:41:50,863 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-05 16:41:50,864 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1455018626] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-05 16:41:50,864 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-05 16:41:50,864 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2021-11-05 16:41:50,864 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975339052] [2021-11-05 16:41:50,864 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-05 16:41:50,865 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-05 16:41:50,865 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 16:41:50,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-05 16:41:50,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2021-11-05 16:41:50,866 INFO L87 Difference]: Start difference. First operand 2119 states and 3026 transitions. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 16:41:51,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 16:41:51,046 INFO L93 Difference]: Finished difference Result 4234 states and 6052 transitions. [2021-11-05 16:41:51,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-05 16:41:51,046 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 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-05 16:41:51,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 16:41:51,053 INFO L225 Difference]: With dead ends: 4234 [2021-11-05 16:41:51,053 INFO L226 Difference]: Without dead ends: 2125 [2021-11-05 16:41:51,057 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 70.16ms TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2021-11-05 16:41:51,057 INFO L933 BasicCegarLoop]: 623 mSDtfsCounter, 611 mSDsluCounter, 1865 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.42ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 611 SdHoareTripleChecker+Valid, 2488 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.52ms SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 26.53ms IncrementalHoareTripleChecker+Time [2021-11-05 16:41:51,058 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [611 Valid, 2488 Invalid, 36 Unknown, 0 Unchecked, 3.52ms Time], IncrementalHoareTripleChecker [14 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 26.53ms Time] [2021-11-05 16:41:51,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2125 states. [2021-11-05 16:41:51,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2125 to 2125. [2021-11-05 16:41:51,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2125 states, 2124 states have (on average 1.4274952919020716) internal successors, (3032), 2124 states have internal predecessors, (3032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 16:41:51,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2125 states to 2125 states and 3032 transitions. [2021-11-05 16:41:51,169 INFO L78 Accepts]: Start accepts. Automaton has 2125 states and 3032 transitions. Word has length 71 [2021-11-05 16:41:51,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 16:41:51,169 INFO L470 AbstractCegarLoop]: Abstraction has 2125 states and 3032 transitions. [2021-11-05 16:41:51,170 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 16:41:51,170 INFO L276 IsEmpty]: Start isEmpty. Operand 2125 states and 3032 transitions. [2021-11-05 16:41:51,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-11-05 16:41:51,172 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 16:41:51,172 INFO L514 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-05 16:41:51,208 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-05 16:41:51,410 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-05 16:41:51,410 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-05 16:41:51,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 16:41:51,411 INFO L85 PathProgramCache]: Analyzing trace with hash 21460015, now seen corresponding path program 2 times [2021-11-05 16:41:51,411 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 16:41:51,411 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091034701] [2021-11-05 16:41:51,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 16:41:51,411 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 16:41:51,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 16:41:51,724 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-05 16:41:51,724 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 16:41:51,724 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091034701] [2021-11-05 16:41:51,725 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091034701] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 16:41:51,725 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 16:41:51,725 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-05 16:41:51,725 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857852503] [2021-11-05 16:41:51,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 16:41:51,725 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-05 16:41:51,725 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 16:41:51,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-05 16:41:51,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2021-11-05 16:41:51,726 INFO L87 Difference]: Start difference. First operand 2125 states and 3032 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-05 16:41:53,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 16:41:53,619 INFO L93 Difference]: Finished difference Result 12013 states and 17426 transitions. [2021-11-05 16:41:53,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-11-05 16:41:53,620 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 77 [2021-11-05 16:41:53,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 16:41:53,637 INFO L225 Difference]: With dead ends: 12013 [2021-11-05 16:41:53,637 INFO L226 Difference]: Without dead ends: 9908 [2021-11-05 16:41:53,641 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 650.05ms TimeCoverageRelationStatistics Valid=316, Invalid=806, Unknown=0, NotChecked=0, Total=1122 [2021-11-05 16:41:53,641 INFO L933 BasicCegarLoop]: 1530 mSDtfsCounter, 9337 mSDsluCounter, 9263 mSDsCounter, 0 mSdLazyCounter, 805 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 572.23ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 9337 SdHoareTripleChecker+Valid, 10793 SdHoareTripleChecker+Invalid, 859 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 23.37ms SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 805 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 688.71ms IncrementalHoareTripleChecker+Time [2021-11-05 16:41:53,641 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9337 Valid, 10793 Invalid, 859 Unknown, 0 Unchecked, 23.37ms Time], IncrementalHoareTripleChecker [54 Valid, 805 Invalid, 0 Unknown, 0 Unchecked, 688.71ms Time] [2021-11-05 16:41:53,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9908 states. [2021-11-05 16:41:53,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9908 to 2237. [2021-11-05 16:41:53,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2237 states, 2236 states have (on average 1.4060822898032201) internal successors, (3144), 2236 states have internal predecessors, (3144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 16:41:53,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2237 states to 2237 states and 3144 transitions. [2021-11-05 16:41:53,901 INFO L78 Accepts]: Start accepts. Automaton has 2237 states and 3144 transitions. Word has length 77 [2021-11-05 16:41:53,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 16:41:53,902 INFO L470 AbstractCegarLoop]: Abstraction has 2237 states and 3144 transitions. [2021-11-05 16:41:53,902 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-05 16:41:53,902 INFO L276 IsEmpty]: Start isEmpty. Operand 2237 states and 3144 transitions. [2021-11-05 16:41:53,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-11-05 16:41:53,907 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 16:41:53,907 INFO L514 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-05 16:41:53,908 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-05 16:41:53,908 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-05 16:41:53,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 16:41:53,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1164854511, now seen corresponding path program 1 times [2021-11-05 16:41:53,909 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 16:41:53,909 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889475032] [2021-11-05 16:41:53,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 16:41:53,909 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 16:41:53,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 16:41:54,402 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-05 16:41:54,402 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 16:41:54,402 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889475032] [2021-11-05 16:41:54,402 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889475032] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 16:41:54,402 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 16:41:54,402 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-11-05 16:41:54,403 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051975627] [2021-11-05 16:41:54,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 16:41:54,403 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-05 16:41:54,403 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 16:41:54,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-05 16:41:54,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2021-11-05 16:41:54,404 INFO L87 Difference]: Start difference. First operand 2237 states and 3144 transitions. Second operand has 19 states, 19 states have (on average 4.368421052631579) internal successors, (83), 18 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 16:42:06,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 16:42:06,154 INFO L93 Difference]: Finished difference Result 15909 states and 23062 transitions. [2021-11-05 16:42:06,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-11-05 16:42:06,155 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 4.368421052631579) internal successors, (83), 18 states have internal predecessors, (83), 0 states have call successors, (0), 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 89 [2021-11-05 16:42:06,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 16:42:06,184 INFO L225 Difference]: With dead ends: 15909 [2021-11-05 16:42:06,184 INFO L226 Difference]: Without dead ends: 13692 [2021-11-05 16:42:06,192 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 385 ImplicationChecksByTransitivity, 1092.43ms TimeCoverageRelationStatistics Valid=439, Invalid=1631, Unknown=0, NotChecked=0, Total=2070 [2021-11-05 16:42:06,192 INFO L933 BasicCegarLoop]: 1130 mSDtfsCounter, 7975 mSDsluCounter, 11462 mSDsCounter, 0 mSdLazyCounter, 2645 mSolverCounterSat, 224 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9248.79ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 7975 SdHoareTripleChecker+Valid, 12592 SdHoareTripleChecker+Invalid, 2869 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 31.67ms SdHoareTripleChecker+Time, 224 IncrementalHoareTripleChecker+Valid, 2645 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9847.57ms IncrementalHoareTripleChecker+Time [2021-11-05 16:42:06,193 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7975 Valid, 12592 Invalid, 2869 Unknown, 0 Unchecked, 31.67ms Time], IncrementalHoareTripleChecker [224 Valid, 2645 Invalid, 0 Unknown, 0 Unchecked, 9847.57ms Time] [2021-11-05 16:42:06,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13692 states. [2021-11-05 16:42:06,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13692 to 4305. [2021-11-05 16:42:06,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4305 states, 4304 states have (on average 1.4026486988847584) internal successors, (6037), 4304 states have internal predecessors, (6037), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 16:42:06,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4305 states to 4305 states and 6037 transitions. [2021-11-05 16:42:06,590 INFO L78 Accepts]: Start accepts. Automaton has 4305 states and 6037 transitions. Word has length 89 [2021-11-05 16:42:06,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 16:42:06,591 INFO L470 AbstractCegarLoop]: Abstraction has 4305 states and 6037 transitions. [2021-11-05 16:42:06,591 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.368421052631579) internal successors, (83), 18 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 16:42:06,591 INFO L276 IsEmpty]: Start isEmpty. Operand 4305 states and 6037 transitions. [2021-11-05 16:42:06,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-11-05 16:42:06,595 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 16:42:06,595 INFO L514 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, 1] [2021-11-05 16:42:06,596 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-05 16:42:06,596 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-05 16:42:06,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 16:42:06,596 INFO L85 PathProgramCache]: Analyzing trace with hash -1787911897, now seen corresponding path program 1 times [2021-11-05 16:42:06,596 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 16:42:06,596 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044086914] [2021-11-05 16:42:06,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 16:42:06,597 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 16:42:06,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 16:42:06,742 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2021-11-05 16:42:06,743 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 16:42:06,743 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044086914] [2021-11-05 16:42:06,743 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044086914] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-05 16:42:06,743 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1195493471] [2021-11-05 16:42:06,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 16:42:06,743 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-05 16:42:06,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-05 16:42:06,745 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-05 16:42:06,747 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-05 16:42:07,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 16:42:07,013 INFO L263 TraceCheckSpWp]: Trace formula consists of 1143 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-05 16:42:07,017 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-05 16:42:07,176 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2021-11-05 16:42:07,177 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-05 16:42:07,316 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2021-11-05 16:42:07,316 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1195493471] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-05 16:42:07,316 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2021-11-05 16:42:07,316 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 5] total 6 [2021-11-05 16:42:07,316 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867895774] [2021-11-05 16:42:07,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 16:42:07,317 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-05 16:42:07,317 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 16:42:07,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-05 16:42:07,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-11-05 16:42:07,318 INFO L87 Difference]: Start difference. First operand 4305 states and 6037 transitions. Second operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 16:42:08,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 16:42:08,788 INFO L93 Difference]: Finished difference Result 12955 states and 18241 transitions. [2021-11-05 16:42:08,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-05 16:42:08,788 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 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 90 [2021-11-05 16:42:08,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 16:42:08,804 INFO L225 Difference]: With dead ends: 12955 [2021-11-05 16:42:08,804 INFO L226 Difference]: Without dead ends: 8670 [2021-11-05 16:42:08,810 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 176 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 23.61ms TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-11-05 16:42:08,810 INFO L933 BasicCegarLoop]: 1179 mSDtfsCounter, 568 mSDsluCounter, 1095 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 654.07ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 568 SdHoareTripleChecker+Valid, 2274 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.15ms SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 765.99ms IncrementalHoareTripleChecker+Time [2021-11-05 16:42:08,811 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [568 Valid, 2274 Invalid, 237 Unknown, 0 Unchecked, 3.15ms Time], IncrementalHoareTripleChecker [53 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 765.99ms Time] [2021-11-05 16:42:08,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8670 states. [2021-11-05 16:42:09,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8670 to 4529. [2021-11-05 16:42:09,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4529 states, 4528 states have (on average 1.407464664310954) internal successors, (6373), 4528 states have internal predecessors, (6373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 16:42:09,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4529 states to 4529 states and 6373 transitions. [2021-11-05 16:42:09,220 INFO L78 Accepts]: Start accepts. Automaton has 4529 states and 6373 transitions. Word has length 90 [2021-11-05 16:42:09,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 16:42:09,220 INFO L470 AbstractCegarLoop]: Abstraction has 4529 states and 6373 transitions. [2021-11-05 16:42:09,221 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 16:42:09,221 INFO L276 IsEmpty]: Start isEmpty. Operand 4529 states and 6373 transitions. [2021-11-05 16:42:09,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-11-05 16:42:09,227 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 16:42:09,227 INFO L514 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, 1] [2021-11-05 16:42:09,268 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-05 16:42:09,443 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2021-11-05 16:42:09,444 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-05 16:42:09,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 16:42:09,444 INFO L85 PathProgramCache]: Analyzing trace with hash -1444775063, now seen corresponding path program 1 times [2021-11-05 16:42:09,444 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 16:42:09,444 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644792148] [2021-11-05 16:42:09,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 16:42:09,445 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 16:42:09,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 16:42:09,542 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2021-11-05 16:42:09,543 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 16:42:09,543 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644792148] [2021-11-05 16:42:09,543 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644792148] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 16:42:09,543 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 16:42:09,543 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-05 16:42:09,543 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794166066] [2021-11-05 16:42:09,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 16:42:09,544 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-05 16:42:09,544 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 16:42:09,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-05 16:42:09,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-05 16:42:09,544 INFO L87 Difference]: Start difference. First operand 4529 states and 6373 transitions. Second operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 16:42:10,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 16:42:10,879 INFO L93 Difference]: Finished difference Result 13179 states and 18465 transitions. [2021-11-05 16:42:10,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-05 16:42:10,880 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 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 90 [2021-11-05 16:42:10,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 16:42:10,891 INFO L225 Difference]: With dead ends: 13179 [2021-11-05 16:42:10,892 INFO L226 Difference]: Without dead ends: 8670 [2021-11-05 16:42:10,897 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.30ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-05 16:42:10,898 INFO L933 BasicCegarLoop]: 1067 mSDtfsCounter, 1122 mSDsluCounter, 1138 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 557.68ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1122 SdHoareTripleChecker+Valid, 2205 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.96ms SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 630.98ms IncrementalHoareTripleChecker+Time [2021-11-05 16:42:10,898 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1122 Valid, 2205 Invalid, 193 Unknown, 0 Unchecked, 3.96ms Time], IncrementalHoareTripleChecker [41 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 630.98ms Time] [2021-11-05 16:42:10,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8670 states. [2021-11-05 16:42:11,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8670 to 4641. [2021-11-05 16:42:11,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4641 states, 4640 states have (on average 1.3959051724137932) internal successors, (6477), 4640 states have internal predecessors, (6477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 16:42:11,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4641 states to 4641 states and 6477 transitions. [2021-11-05 16:42:11,346 INFO L78 Accepts]: Start accepts. Automaton has 4641 states and 6477 transitions. Word has length 90 [2021-11-05 16:42:11,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 16:42:11,346 INFO L470 AbstractCegarLoop]: Abstraction has 4641 states and 6477 transitions. [2021-11-05 16:42:11,346 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 16:42:11,346 INFO L276 IsEmpty]: Start isEmpty. Operand 4641 states and 6477 transitions. [2021-11-05 16:42:11,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-11-05 16:42:11,350 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 16:42:11,350 INFO L514 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, 1, 1] [2021-11-05 16:42:11,350 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-05 16:42:11,350 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-05 16:42:11,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 16:42:11,352 INFO L85 PathProgramCache]: Analyzing trace with hash 1508746801, now seen corresponding path program 1 times [2021-11-05 16:42:11,352 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 16:42:11,352 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9431936] [2021-11-05 16:42:11,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 16:42:11,352 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 16:42:11,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 16:42:12,281 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-11-05 16:42:12,281 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 16:42:12,281 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9431936] [2021-11-05 16:42:12,281 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9431936] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-05 16:42:12,281 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [784802568] [2021-11-05 16:42:12,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 16:42:12,282 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-05 16:42:12,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-05 16:42:12,283 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-05 16:42:12,284 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-05 16:42:12,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 16:42:12,680 INFO L263 TraceCheckSpWp]: Trace formula consists of 1153 conjuncts, 97 conjunts are in the unsatisfiable core [2021-11-05 16:42:12,684 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-05 16:42:13,144 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-05 16:42:13,437 INFO L354 Elim1Store]: treesize reduction 70, result has 24.7 percent of original size [2021-11-05 16:42:13,438 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 46 treesize of output 61 [2021-11-05 16:42:13,462 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-05 16:42:18,764 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-11-05 16:42:18,764 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 22 [2021-11-05 16:42:18,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 16:42:18,773 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2021-11-05 16:42:18,779 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 72 treesize of output 68 [2021-11-05 16:42:18,782 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 65 treesize of output 61 [2021-11-05 16:42:21,949 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 63 treesize of output 57 [2021-11-05 16:42:21,975 INFO L354 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2021-11-05 16:42:21,975 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 3 case distinctions, treesize of input 38 treesize of output 25 [2021-11-05 16:42:21,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 16:42:21,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 16:42:21,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 16:42:21,986 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 25 [2021-11-05 16:42:25,258 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-11-05 16:42:25,258 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 117 treesize of output 93 [2021-11-05 16:42:25,266 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-11-05 16:42:25,266 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 87 treesize of output 69 [2021-11-05 16:42:27,442 INFO L354 Elim1Store]: treesize reduction 26, result has 16.1 percent of original size [2021-11-05 16:42:27,443 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 80 treesize of output 78 [2021-11-05 16:42:27,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 16:42:27,447 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 75 treesize of output 79 [2021-11-05 16:42:34,720 INFO L354 Elim1Store]: treesize reduction 30, result has 14.3 percent of original size [2021-11-05 16:42:34,720 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 87 treesize of output 85 [2021-11-05 16:42:34,734 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-11-05 16:42:34,734 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 86 [2021-11-05 16:43:06,028 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-05 16:43:06,028 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 81 treesize of output 75 [2021-11-05 16:43:06,031 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2021-11-05 16:43:06,122 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-11-05 16:43:06,122 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-05 16:43:57,159 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 162 treesize of output 158 [2021-11-05 16:43:57,179 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 232 treesize of output 230 [2021-11-05 16:43:59,297 WARN L838 $PredicateComparison]: unable to prove that (forall ((ULTIMATE.start_ldv_alloc_skb_12_~tmp~12.offset Int) (v_DerPreprocessor_8 Int) (|v_ULTIMATE.start_#Ultimate.C_memcpy_dest.offset_59| Int) (v_DerPreprocessor_7 Int) (v_DerPreprocessor_4 Int) (v_ULTIMATE.start_skb_put_~arg1_9 Int)) (or (< |c_ULTIMATE.start_ldv_malloc_#res.offset| |v_ULTIMATE.start_#Ultimate.C_memcpy_dest.offset_59|) (< 0 (mod (select (select (let ((.cse0 (store |c_#memory_int| c_ULTIMATE.start_ldv_alloc_skb_12_~tmp~12.base (let ((.cse1 (store (store (select |c_#memory_int| c_ULTIMATE.start_ldv_alloc_skb_12_~tmp~12.base) (+ ULTIMATE.start_ldv_alloc_skb_12_~tmp~12.offset 224) v_DerPreprocessor_8) (+ 232 ULTIMATE.start_ldv_alloc_skb_12_~tmp~12.offset) v_DerPreprocessor_7)) (.cse2 (+ ULTIMATE.start_ldv_alloc_skb_12_~tmp~12.offset 216))) (store .cse1 .cse2 (+ (select .cse1 .cse2) v_ULTIMATE.start_skb_put_~arg1_9)))))) (store .cse0 |c_ULTIMATE.start_ldv_malloc_#res.base| (store (select .cse0 |c_ULTIMATE.start_ldv_malloc_#res.base|) |v_ULTIMATE.start_#Ultimate.C_memcpy_dest.offset_59| v_DerPreprocessor_4))) c_ULTIMATE.start_cx82310_rx_fixup_~dev.base) (+ 460 c_ULTIMATE.start_cx82310_rx_fixup_~dev.offset)) 18446744073709551616)))) is different from false [2021-11-05 16:44:00,874 WARN L838 $PredicateComparison]: unable to prove that (forall ((ULTIMATE.start_ldv_alloc_skb_12_~tmp~12.offset Int) (v_DerPreprocessor_8 Int) (|v_ULTIMATE.start_#Ultimate.C_memcpy_dest.offset_59| Int) (v_DerPreprocessor_7 Int) (v_DerPreprocessor_4 Int) (v_ULTIMATE.start_skb_put_~arg1_9 Int)) (or (< 0 (mod (select (select (let ((.cse0 (store |c_#memory_int| c_ULTIMATE.start_ldv_alloc_skb_12_~tmp~12.base (let ((.cse1 (store (store (select |c_#memory_int| c_ULTIMATE.start_ldv_alloc_skb_12_~tmp~12.base) (+ ULTIMATE.start_ldv_alloc_skb_12_~tmp~12.offset 224) v_DerPreprocessor_8) (+ 232 ULTIMATE.start_ldv_alloc_skb_12_~tmp~12.offset) v_DerPreprocessor_7)) (.cse2 (+ ULTIMATE.start_ldv_alloc_skb_12_~tmp~12.offset 216))) (store .cse1 .cse2 (+ (select .cse1 .cse2) v_ULTIMATE.start_skb_put_~arg1_9)))))) (store .cse0 0 (store (select .cse0 0) |v_ULTIMATE.start_#Ultimate.C_memcpy_dest.offset_59| v_DerPreprocessor_4))) c_ULTIMATE.start_cx82310_rx_fixup_~dev.base) (+ 460 c_ULTIMATE.start_cx82310_rx_fixup_~dev.offset)) 18446744073709551616)) (< 0 |v_ULTIMATE.start_#Ultimate.C_memcpy_dest.offset_59|))) is different from false [2021-11-05 16:44:02,811 WARN L838 $PredicateComparison]: unable to prove that (forall ((ULTIMATE.start_ldv_alloc_skb_12_~tmp~12.offset Int) (v_DerPreprocessor_8 Int) (|v_ULTIMATE.start_#Ultimate.C_memcpy_dest.offset_59| Int) (v_DerPreprocessor_7 Int) (v_DerPreprocessor_4 Int) (v_ULTIMATE.start_skb_put_~arg1_9 Int)) (or (< 0 (mod (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_ldv_skb_alloc_#res.base| (let ((.cse1 (store (store (select |c_#memory_int| |c_ULTIMATE.start_ldv_skb_alloc_#res.base|) (+ ULTIMATE.start_ldv_alloc_skb_12_~tmp~12.offset 224) v_DerPreprocessor_8) (+ 232 ULTIMATE.start_ldv_alloc_skb_12_~tmp~12.offset) v_DerPreprocessor_7)) (.cse2 (+ ULTIMATE.start_ldv_alloc_skb_12_~tmp~12.offset 216))) (store .cse1 .cse2 (+ v_ULTIMATE.start_skb_put_~arg1_9 (select .cse1 .cse2))))))) (store .cse0 0 (store (select .cse0 0) |v_ULTIMATE.start_#Ultimate.C_memcpy_dest.offset_59| v_DerPreprocessor_4))) c_ULTIMATE.start_cx82310_rx_fixup_~dev.base) (+ 460 c_ULTIMATE.start_cx82310_rx_fixup_~dev.offset)) 18446744073709551616)) (< 0 |v_ULTIMATE.start_#Ultimate.C_memcpy_dest.offset_59|))) is different from false [2021-11-05 16:44:04,852 WARN L838 $PredicateComparison]: unable to prove that (forall ((ULTIMATE.start_ldv_alloc_skb_12_~tmp~12.offset Int) (v_DerPreprocessor_8 Int) (|v_ULTIMATE.start_#Ultimate.C_memcpy_dest.offset_59| Int) (v_DerPreprocessor_7 Int) (v_DerPreprocessor_4 Int) (v_ULTIMATE.start_skb_put_~arg1_9 Int)) (or (< 0 (mod (select (select (let ((.cse0 (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) (+ ULTIMATE.start_ldv_alloc_skb_12_~tmp~12.offset 224) v_DerPreprocessor_8) (+ 232 ULTIMATE.start_ldv_alloc_skb_12_~tmp~12.offset) v_DerPreprocessor_7)) (.cse2 (+ ULTIMATE.start_ldv_alloc_skb_12_~tmp~12.offset 216))) (store .cse1 .cse2 (+ v_ULTIMATE.start_skb_put_~arg1_9 (select .cse1 .cse2))))))) (store .cse0 0 (store (select .cse0 0) |v_ULTIMATE.start_#Ultimate.C_memcpy_dest.offset_59| v_DerPreprocessor_4))) c_ULTIMATE.start_cx82310_rx_fixup_~dev.base) (+ 460 c_ULTIMATE.start_cx82310_rx_fixup_~dev.offset)) 18446744073709551616)) (< 0 |v_ULTIMATE.start_#Ultimate.C_memcpy_dest.offset_59|))) is different from false [2021-11-05 16:45:03,294 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_9 Int) (ULTIMATE.start_ldv_alloc_skb_12_~tmp~12.offset Int) (v_DerPreprocessor_8 Int) (|v_ULTIMATE.start_#Ultimate.C_memcpy_dest.offset_59| Int) (|~#set_impl~0.offset| Int) (v_DerPreprocessor_7 Int) (v_DerPreprocessor_4 Int) (~last_index~0 Int) (v_ULTIMATE.start_skb_put_~arg1_9 Int)) (or (< 0 (mod (select (select (let ((.cse0 (let ((.cse1 (store |c_#memory_int| |c_~#set_impl~0.base| (store (select |c_#memory_int| |c_~#set_impl~0.base|) (+ (* ~last_index~0 8) |~#set_impl~0.offset|) v_DerPreprocessor_9)))) (store .cse1 c_ULTIMATE.start_ldv_zalloc_~p~1.base (let ((.cse2 (store (store (select .cse1 c_ULTIMATE.start_ldv_zalloc_~p~1.base) (+ ULTIMATE.start_ldv_alloc_skb_12_~tmp~12.offset 224) v_DerPreprocessor_8) (+ 232 ULTIMATE.start_ldv_alloc_skb_12_~tmp~12.offset) v_DerPreprocessor_7)) (.cse3 (+ ULTIMATE.start_ldv_alloc_skb_12_~tmp~12.offset 216))) (store .cse2 .cse3 (+ (select .cse2 .cse3) v_ULTIMATE.start_skb_put_~arg1_9))))))) (store .cse0 0 (store (select .cse0 0) |v_ULTIMATE.start_#Ultimate.C_memcpy_dest.offset_59| v_DerPreprocessor_4))) c_ULTIMATE.start_cx82310_rx_fixup_~dev.base) (+ 460 c_ULTIMATE.start_cx82310_rx_fixup_~dev.offset)) 18446744073709551616)) (< 0 |v_ULTIMATE.start_#Ultimate.C_memcpy_dest.offset_59|))) is different from false [2021-11-05 16:45:37,002 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_ldv_zalloc_#t~malloc35.base_34| Int) (v_DerPreprocessor_9 Int) (ULTIMATE.start_ldv_alloc_skb_12_~tmp~12.offset Int) (v_DerPreprocessor_8 Int) (|v_ULTIMATE.start_#Ultimate.C_memcpy_dest.offset_59| Int) (|~#set_impl~0.offset| Int) (v_DerPreprocessor_7 Int) (v_DerPreprocessor_4 Int) (~last_index~0 Int) (v_ULTIMATE.start_skb_put_~arg1_9 Int)) (or (= |v_ULTIMATE.start_ldv_zalloc_#t~malloc35.base_34| 0) (< 0 (mod (select (select (let ((.cse0 (let ((.cse1 (let ((.cse4 (store |c_#memory_int| |v_ULTIMATE.start_ldv_zalloc_#t~malloc35.base_34| ((as const (Array Int Int)) 0)))) (store .cse4 |c_~#set_impl~0.base| (store (select .cse4 |c_~#set_impl~0.base|) (+ (* ~last_index~0 8) |~#set_impl~0.offset|) v_DerPreprocessor_9))))) (store .cse1 |v_ULTIMATE.start_ldv_zalloc_#t~malloc35.base_34| (let ((.cse2 (store (store (select .cse1 |v_ULTIMATE.start_ldv_zalloc_#t~malloc35.base_34|) (+ ULTIMATE.start_ldv_alloc_skb_12_~tmp~12.offset 224) v_DerPreprocessor_8) (+ 232 ULTIMATE.start_ldv_alloc_skb_12_~tmp~12.offset) v_DerPreprocessor_7)) (.cse3 (+ ULTIMATE.start_ldv_alloc_skb_12_~tmp~12.offset 216))) (store .cse2 .cse3 (+ v_ULTIMATE.start_skb_put_~arg1_9 (select .cse2 .cse3)))))))) (store .cse0 0 (store (select .cse0 0) |v_ULTIMATE.start_#Ultimate.C_memcpy_dest.offset_59| v_DerPreprocessor_4))) c_ULTIMATE.start_cx82310_rx_fixup_~dev.base) (+ 460 c_ULTIMATE.start_cx82310_rx_fixup_~dev.offset)) 18446744073709551616)) (< 0 |v_ULTIMATE.start_#Ultimate.C_memcpy_dest.offset_59|))) is different from false [2021-11-05 16:45:52,006 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Undeclared function symbol (ite Bool Int (Array Int Int)) [2021-11-05 16:45:52,006 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-11-05 16:45:52,006 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2021-11-05 16:45:52,006 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075833471] [2021-11-05 16:45:52,006 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-11-05 16:45:52,006 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-11-05 16:45:52,007 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 16:45:52,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-11-05 16:45:52,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=3339, Unknown=86, NotChecked=738, Total=4422 [2021-11-05 16:45:52,008 INFO L87 Difference]: Start difference. First operand 4641 states and 6477 transitions. Second operand has 25 states, 25 states have (on average 3.4) internal successors, (85), 24 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 16:45:52,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-05 16:45:52,010 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 1127 ImplicationChecksByTransitivity, 217746.99ms TimeCoverageRelationStatistics Valid=259, Invalid=3339, Unknown=86, NotChecked=738, Total=4422 [2021-11-05 16:45:52,011 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.00ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.02ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.00ms IncrementalHoareTripleChecker+Time [2021-11-05 16:45:52,012 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 1 Invalid, 1 Unknown, 0 Unchecked, 0.02ms Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.00ms Time] [2021-11-05 16:45:52,037 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2021-11-05 16:45:52,234 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-05 16:45:52,235 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@69ca58c9 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:359) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.prepareAssertionStackAndAddTransition(IncrementalHoareTripleChecker.java:206) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.checkInternal(IncrementalHoareTripleChecker.java:131) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker$ProtectedHtc.checkInternal(ChainingHoareTripleChecker.java:436) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker.checkInternal(ChainingHoareTripleChecker.java:98) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:95) 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:868) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:784) 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-05 16:45:52,238 INFO L158 Benchmark]: Toolchain (without parser) took 249187.50ms. Allocated memory was 71.3MB in the beginning and 973.1MB in the end (delta: 901.8MB). Free memory was 47.1MB in the beginning and 702.3MB in the end (delta: -655.2MB). Peak memory consumption was 247.1MB. Max. memory is 16.1GB. [2021-11-05 16:45:52,238 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 71.3MB. Free memory is still 53.2MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-05 16:45:52,238 INFO L158 Benchmark]: CACSL2BoogieTranslator took 973.34ms. Allocated memory was 71.3MB in the beginning and 115.3MB in the end (delta: 44.0MB). Free memory was 47.0MB in the beginning and 74.1MB in the end (delta: -27.2MB). Peak memory consumption was 49.6MB. Max. memory is 16.1GB. [2021-11-05 16:45:52,239 INFO L158 Benchmark]: Boogie Procedure Inliner took 122.40ms. Allocated memory is still 115.3MB. Free memory was 74.1MB in the beginning and 61.0MB in the end (delta: 13.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2021-11-05 16:45:52,239 INFO L158 Benchmark]: Boogie Preprocessor took 148.94ms. Allocated memory is still 115.3MB. Free memory was 61.0MB in the beginning and 47.4MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-11-05 16:45:52,239 INFO L158 Benchmark]: RCFGBuilder took 2467.22ms. Allocated memory was 115.3MB in the beginning and 226.5MB in the end (delta: 111.1MB). Free memory was 47.4MB in the beginning and 112.3MB in the end (delta: -64.9MB). Peak memory consumption was 86.6MB. Max. memory is 16.1GB. [2021-11-05 16:45:52,239 INFO L158 Benchmark]: TraceAbstraction took 245471.05ms. Allocated memory was 226.5MB in the beginning and 973.1MB in the end (delta: 746.6MB). Free memory was 111.2MB in the beginning and 702.3MB in the end (delta: -591.1MB). Peak memory consumption was 156.0MB. Max. memory is 16.1GB. [2021-11-05 16:45:52,240 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.18ms. Allocated memory is still 71.3MB. Free memory is still 53.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 973.34ms. Allocated memory was 71.3MB in the beginning and 115.3MB in the end (delta: 44.0MB). Free memory was 47.0MB in the beginning and 74.1MB in the end (delta: -27.2MB). Peak memory consumption was 49.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 122.40ms. Allocated memory is still 115.3MB. Free memory was 74.1MB in the beginning and 61.0MB in the end (delta: 13.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 148.94ms. Allocated memory is still 115.3MB. Free memory was 61.0MB in the beginning and 47.4MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * RCFGBuilder took 2467.22ms. Allocated memory was 115.3MB in the beginning and 226.5MB in the end (delta: 111.1MB). Free memory was 47.4MB in the beginning and 112.3MB in the end (delta: -64.9MB). Peak memory consumption was 86.6MB. Max. memory is 16.1GB. * TraceAbstraction took 245471.05ms. Allocated memory was 226.5MB in the beginning and 973.1MB in the end (delta: 746.6MB). Free memory was 111.2MB in the beginning and 702.3MB in the end (delta: -591.1MB). Peak memory consumption was 156.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@69ca58c9 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@69ca58c9: 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-05 16:45:52,395 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-wip.dd.seqcomp-5f08f0f [2021-11-05 16:45:54,036 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-05 16:45:54,039 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-05 16:45:54,072 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-05 16:45:54,072 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-05 16:45:54,075 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-05 16:45:54,077 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-05 16:45:54,081 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-05 16:45:54,083 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-05 16:45:54,086 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-05 16:45:54,087 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-05 16:45:54,090 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-05 16:45:54,090 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-05 16:45:54,092 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-05 16:45:54,093 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-05 16:45:54,095 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-05 16:45:54,096 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-05 16:45:54,097 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-05 16:45:54,098 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-05 16:45:54,103 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-05 16:45:54,103 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-05 16:45:54,104 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-05 16:45:54,105 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-05 16:45:54,106 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-05 16:45:54,110 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-05 16:45:54,110 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-05 16:45:54,110 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-05 16:45:54,124 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-05 16:45:54,124 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-05 16:45:54,125 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-05 16:45:54,125 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-05 16:45:54,125 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-05 16:45:54,126 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-05 16:45:54,127 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-05 16:45:54,127 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-05 16:45:54,128 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-05 16:45:54,128 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-05 16:45:54,128 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-05 16:45:54,128 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-05 16:45:54,129 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-05 16:45:54,129 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-05 16:45:54,140 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2021-11-05 16:45:54,160 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-05 16:45:54,160 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-05 16:45:54,161 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-05 16:45:54,161 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-05 16:45:54,162 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-05 16:45:54,163 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-05 16:45:54,163 INFO L138 SettingsManager]: * Use SBE=true [2021-11-05 16:45:54,163 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-05 16:45:54,163 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-05 16:45:54,163 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-05 16:45:54,164 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-05 16:45:54,164 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-05 16:45:54,164 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-11-05 16:45:54,164 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-11-05 16:45:54,165 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-05 16:45:54,165 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-05 16:45:54,165 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-05 16:45:54,165 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-05 16:45:54,165 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-05 16:45:54,165 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-05 16:45:54,165 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-05 16:45:54,166 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-05 16:45:54,166 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-05 16:45:54,166 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-05 16:45:54,166 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-11-05 16:45:54,166 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-11-05 16:45:54,166 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-05 16:45:54,166 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-05 16:45:54,167 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-05 16:45:54,167 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-05 16:45:54,167 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-05 16:45:54,167 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-05 16:45:54,475 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-05 16:45:54,490 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-05 16:45:54,492 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-05 16:45:54,493 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-05 16:45:54,493 INFO L275 PluginConnector]: CDTParser initialized [2021-11-05 16:45:54,494 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-05 16:45:54,561 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2891b5b8e/d95a813d949f4582a3c8b65c376e41c3/FLAG9eaa72df4 [2021-11-05 16:45:55,144 INFO L306 CDTParser]: Found 1 translation units. [2021-11-05 16:45:55,145 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-05 16:45:55,179 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2891b5b8e/d95a813d949f4582a3c8b65c376e41c3/FLAG9eaa72df4 [2021-11-05 16:45:55,579 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2891b5b8e/d95a813d949f4582a3c8b65c376e41c3 [2021-11-05 16:45:55,581 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-05 16:45:55,582 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-05 16:45:55,584 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-05 16:45:55,584 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-05 16:45:55,588 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-05 16:45:55,589 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 04:45:55" (1/1) ... [2021-11-05 16:45:55,590 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77bffb47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 04:45:55, skipping insertion in model container [2021-11-05 16:45:55,590 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 04:45:55" (1/1) ... [2021-11-05 16:45:55,595 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-05 16:45:55,674 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-05 16:45:56,116 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-05 16:45:56,316 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-05 16:45:56,341 INFO L203 MainTranslator]: Completed pre-run [2021-11-05 16:45:56,475 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-05 16:45:56,541 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-05 16:45:56,573 INFO L208 MainTranslator]: Completed translation [2021-11-05 16:45:56,575 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 04:45:56 WrapperNode [2021-11-05 16:45:56,575 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-05 16:45:56,576 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-05 16:45:56,576 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-05 16:45:56,576 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-05 16:45:56,581 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 04:45:56" (1/1) ... [2021-11-05 16:45:56,611 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 04:45:56" (1/1) ... [2021-11-05 16:45:56,721 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-05 16:45:56,722 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-05 16:45:56,723 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-05 16:45:56,723 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-05 16:45:56,729 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 04:45:56" (1/1) ... [2021-11-05 16:45:56,729 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 04:45:56" (1/1) ... [2021-11-05 16:45:56,754 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 04:45:56" (1/1) ... [2021-11-05 16:45:56,755 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 04:45:56" (1/1) ... [2021-11-05 16:45:56,819 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 04:45:56" (1/1) ... [2021-11-05 16:45:56,839 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 04:45:56" (1/1) ... [2021-11-05 16:45:56,850 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 04:45:56" (1/1) ... [2021-11-05 16:45:56,865 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-05 16:45:56,870 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-05 16:45:56,870 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-05 16:45:56,870 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-05 16:45:56,871 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 04:45:56" (1/1) ... [2021-11-05 16:45:56,877 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-05 16:45:56,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-05 16:45:56,894 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-05 16:45:56,957 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-05 16:45:56,971 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2021-11-05 16:45:56,972 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2021-11-05 16:45:56,972 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-11-05 16:45:56,972 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2021-11-05 16:45:56,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2021-11-05 16:45:56,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2021-11-05 16:45:56,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2 [2021-11-05 16:45:56,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1 [2021-11-05 16:45:56,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE8 [2021-11-05 16:45:56,973 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-05 16:45:56,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-05 16:45:56,973 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-05 16:45:56,973 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE8 [2021-11-05 16:45:56,974 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE2 [2021-11-05 16:45:56,974 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE4 [2021-11-05 16:45:56,974 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-05 16:45:56,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2021-11-05 16:45:56,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2021-11-05 16:45:56,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2 [2021-11-05 16:45:56,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-11-05 16:45:56,974 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-05 16:45:56,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-05 16:45:56,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-11-05 16:45:56,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2021-11-05 16:45:56,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE8 [2021-11-05 16:45:56,975 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE1 [2021-11-05 16:45:56,975 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-05 16:45:56,975 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-05 16:46:08,947 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-05 16:46:08,947 INFO L299 CfgBuilder]: Removed 377 assume(true) statements. [2021-11-05 16:46:08,949 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 04:46:08 BoogieIcfgContainer [2021-11-05 16:46:08,949 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-05 16:46:08,950 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-05 16:46:08,951 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-05 16:46:08,953 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-05 16:46:08,953 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.11 04:45:55" (1/3) ... [2021-11-05 16:46:08,954 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74993a88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 04:46:08, skipping insertion in model container [2021-11-05 16:46:08,954 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 04:45:56" (2/3) ... [2021-11-05 16:46:08,954 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74993a88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 04:46:08, skipping insertion in model container [2021-11-05 16:46:08,954 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 04:46:08" (3/3) ... [2021-11-05 16:46:08,955 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-05 16:46:08,959 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-05 16:46:08,959 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-05 16:46:09,010 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-05 16:46:09,019 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-05 16:46:09,020 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-05 16:46:09,040 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-05 16:46:09,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-11-05 16:46:09,045 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 16:46:09,046 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 16:46:09,046 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-05 16:46:09,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 16:46:09,050 INFO L85 PathProgramCache]: Analyzing trace with hash 1795372011, now seen corresponding path program 1 times [2021-11-05 16:46:09,058 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-05 16:46:09,059 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1978853442] [2021-11-05 16:46:09,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 16:46:09,059 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-05 16:46:09,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-05 16:46:09,060 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-05 16:46:09,064 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-05 16:46:09,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 16:46:09,363 INFO L263 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-05 16:46:09,366 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-05 16:46:09,587 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-05 16:46:09,587 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-05 16:46:09,738 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-05 16:46:09,739 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-05 16:46:09,739 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1978853442] [2021-11-05 16:46:09,740 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1978853442] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-05 16:46:09,740 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-05 16:46:09,740 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-11-05 16:46:09,741 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301981129] [2021-11-05 16:46:09,741 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-05 16:46:09,745 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-05 16:46:09,745 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-05 16:46:09,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-05 16:46:09,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-05 16:46:09,770 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-05 16:46:09,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 16:46:09,912 INFO L93 Difference]: Finished difference Result 897 states and 1351 transitions. [2021-11-05 16:46:09,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-05 16:46:09,929 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-05 16:46:09,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 16:46:09,943 INFO L225 Difference]: With dead ends: 897 [2021-11-05 16:46:09,943 INFO L226 Difference]: Without dead ends: 445 [2021-11-05 16:46:09,946 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 86.07ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-05 16:46:09,955 INFO L933 BasicCegarLoop]: 635 mSDtfsCounter, 0 mSDsluCounter, 1262 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 73.45ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1897 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 7.57ms SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 84.25ms IncrementalHoareTripleChecker+Time [2021-11-05 16:46:09,958 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 1897 Invalid, 15 Unknown, 0 Unchecked, 7.57ms Time], IncrementalHoareTripleChecker [5 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 84.25ms Time] [2021-11-05 16:46:09,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2021-11-05 16:46:10,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 445. [2021-11-05 16:46:10,073 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-05 16:46:10,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 629 transitions. [2021-11-05 16:46:10,080 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 629 transitions. Word has length 21 [2021-11-05 16:46:10,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 16:46:10,081 INFO L470 AbstractCegarLoop]: Abstraction has 445 states and 629 transitions. [2021-11-05 16:46:10,081 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-05 16:46:10,081 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 629 transitions. [2021-11-05 16:46:10,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-05 16:46:10,091 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 16:46:10,091 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 16:46:10,104 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-05 16:46:10,293 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-05 16:46:10,293 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-05 16:46:10,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 16:46:10,294 INFO L85 PathProgramCache]: Analyzing trace with hash -815280085, now seen corresponding path program 1 times [2021-11-05 16:46:10,294 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-05 16:46:10,295 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1952085903] [2021-11-05 16:46:10,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 16:46:10,295 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-05 16:46:10,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-05 16:46:10,312 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-05 16:46:10,314 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-05 16:46:10,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 16:46:10,678 INFO L263 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-05 16:46:10,679 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-05 16:46:10,963 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-05 16:46:10,963 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-05 16:46:11,347 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-05 16:46:11,347 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-05 16:46:11,347 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1952085903] [2021-11-05 16:46:11,348 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1952085903] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-05 16:46:11,348 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-05 16:46:11,348 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2021-11-05 16:46:11,348 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161705471] [2021-11-05 16:46:11,348 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-05 16:46:11,349 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-05 16:46:11,349 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-05 16:46:11,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-05 16:46:11,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-11-05 16:46:11,349 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-05 16:46:11,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 16:46:11,542 INFO L93 Difference]: Finished difference Result 883 states and 1253 transitions. [2021-11-05 16:46:11,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-05 16:46:11,543 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-05 16:46:11,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 16:46:11,545 INFO L225 Difference]: With dead ends: 883 [2021-11-05 16:46:11,546 INFO L226 Difference]: Without dead ends: 449 [2021-11-05 16:46:11,547 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 373.78ms TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-11-05 16:46:11,548 INFO L933 BasicCegarLoop]: 623 mSDtfsCounter, 0 mSDsluCounter, 1857 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 148.83ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2480 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.87ms SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 173.23ms IncrementalHoareTripleChecker+Time [2021-11-05 16:46:11,548 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 2480 Invalid, 42 Unknown, 0 Unchecked, 2.87ms Time], IncrementalHoareTripleChecker [14 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 173.23ms Time] [2021-11-05 16:46:11,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2021-11-05 16:46:11,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 449. [2021-11-05 16:46:11,556 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-05 16:46:11,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 633 transitions. [2021-11-05 16:46:11,558 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 633 transitions. Word has length 25 [2021-11-05 16:46:11,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 16:46:11,558 INFO L470 AbstractCegarLoop]: Abstraction has 449 states and 633 transitions. [2021-11-05 16:46:11,558 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-05 16:46:11,558 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 633 transitions. [2021-11-05 16:46:11,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-11-05 16:46:11,559 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 16:46:11,559 INFO L514 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-05 16:46:11,571 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2021-11-05 16:46:11,771 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-05 16:46:11,772 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-05 16:46:11,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 16:46:11,773 INFO L85 PathProgramCache]: Analyzing trace with hash -71275413, now seen corresponding path program 2 times [2021-11-05 16:46:11,774 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-05 16:46:11,774 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1657242853] [2021-11-05 16:46:11,774 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-05 16:46:11,774 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-05 16:46:11,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-05 16:46:11,775 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-05 16:46:11,777 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-05 16:46:12,022 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-11-05 16:46:12,023 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-05 16:46:12,038 INFO L263 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-05 16:46:12,039 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-05 16:46:12,208 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-05 16:46:12,208 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-05 16:46:12,366 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-05 16:46:12,367 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-05 16:46:12,367 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1657242853] [2021-11-05 16:46:12,367 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1657242853] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-05 16:46:12,367 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-05 16:46:12,367 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-11-05 16:46:12,367 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26208801] [2021-11-05 16:46:12,367 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-05 16:46:12,368 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-05 16:46:12,368 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-05 16:46:12,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-05 16:46:12,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-05 16:46:12,368 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-05 16:46:14,409 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 16:46:14,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 16:46:14,639 INFO L93 Difference]: Finished difference Result 1671 states and 2389 transitions. [2021-11-05 16:46:14,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-05 16:46:14,640 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-05 16:46:14,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 16:46:14,644 INFO L225 Difference]: With dead ends: 1671 [2021-11-05 16:46:14,645 INFO L226 Difference]: Without dead ends: 1242 [2021-11-05 16:46:14,646 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 38.80ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-05 16:46:14,648 INFO L933 BasicCegarLoop]: 622 mSDtfsCounter, 1144 mSDsluCounter, 1768 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2154.07ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1144 SdHoareTripleChecker+Valid, 2390 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.02ms SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2229.67ms IncrementalHoareTripleChecker+Time [2021-11-05 16:46:14,649 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1144 Valid, 2390 Invalid, 30 Unknown, 0 Unchecked, 4.02ms Time], IncrementalHoareTripleChecker [7 Valid, 22 Invalid, 1 Unknown, 0 Unchecked, 2229.67ms Time] [2021-11-05 16:46:14,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1242 states. [2021-11-05 16:46:14,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1242 to 1242. [2021-11-05 16:46:14,679 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-05 16:46:14,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1242 states to 1242 states and 1775 transitions. [2021-11-05 16:46:14,682 INFO L78 Accepts]: Start accepts. Automaton has 1242 states and 1775 transitions. Word has length 29 [2021-11-05 16:46:14,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 16:46:14,682 INFO L470 AbstractCegarLoop]: Abstraction has 1242 states and 1775 transitions. [2021-11-05 16:46:14,682 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-05 16:46:14,682 INFO L276 IsEmpty]: Start isEmpty. Operand 1242 states and 1775 transitions. [2021-11-05 16:46:14,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-05 16:46:14,683 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 16:46:14,684 INFO L514 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-05 16:46:14,695 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2021-11-05 16:46:14,895 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-05 16:46:14,896 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-05 16:46:14,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 16:46:14,898 INFO L85 PathProgramCache]: Analyzing trace with hash 354616610, now seen corresponding path program 1 times [2021-11-05 16:46:14,898 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-05 16:46:14,898 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [556156226] [2021-11-05 16:46:14,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 16:46:14,899 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-05 16:46:14,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-05 16:46:14,900 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-05 16:46:14,912 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-05 16:46:15,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 16:46:15,299 INFO L263 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-05 16:46:15,301 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-05 16:46:15,706 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-05 16:46:15,706 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-05 16:46:16,176 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-05 16:46:16,176 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-05 16:46:16,177 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [556156226] [2021-11-05 16:46:16,177 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [556156226] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-05 16:46:16,177 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-05 16:46:16,177 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 7 [2021-11-05 16:46:16,178 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931568244] [2021-11-05 16:46:16,178 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-05 16:46:16,178 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-05 16:46:16,178 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-05 16:46:16,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-05 16:46:16,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-11-05 16:46:16,179 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-05 16:46:16,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 16:46:16,848 INFO L93 Difference]: Finished difference Result 3684 states and 5278 transitions. [2021-11-05 16:46:16,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-05 16:46:16,849 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-05 16:46:16,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 16:46:16,857 INFO L225 Difference]: With dead ends: 3684 [2021-11-05 16:46:16,857 INFO L226 Difference]: Without dead ends: 2457 [2021-11-05 16:46:16,860 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 255.10ms TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2021-11-05 16:46:16,862 INFO L933 BasicCegarLoop]: 615 mSDtfsCounter, 593 mSDsluCounter, 2436 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 446.83ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 593 SdHoareTripleChecker+Valid, 3051 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.10ms SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 518.05ms IncrementalHoareTripleChecker+Time [2021-11-05 16:46:16,865 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [593 Valid, 3051 Invalid, 80 Unknown, 0 Unchecked, 4.10ms Time], IncrementalHoareTripleChecker [5 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 518.05ms Time] [2021-11-05 16:46:16,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2457 states. [2021-11-05 16:46:16,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2457 to 2457. [2021-11-05 16:46:16,925 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-05 16:46:16,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2457 states to 2457 states and 3506 transitions. [2021-11-05 16:46:16,933 INFO L78 Accepts]: Start accepts. Automaton has 2457 states and 3506 transitions. Word has length 36 [2021-11-05 16:46:16,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 16:46:16,934 INFO L470 AbstractCegarLoop]: Abstraction has 2457 states and 3506 transitions. [2021-11-05 16:46:16,935 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-05 16:46:16,935 INFO L276 IsEmpty]: Start isEmpty. Operand 2457 states and 3506 transitions. [2021-11-05 16:46:16,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-11-05 16:46:16,939 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 16:46:16,944 INFO L514 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-05 16:46:16,961 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Ended with exit code 0 [2021-11-05 16:46:17,159 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-05 16:46:17,162 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-05 16:46:17,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 16:46:17,162 INFO L85 PathProgramCache]: Analyzing trace with hash -1382112580, now seen corresponding path program 1 times [2021-11-05 16:46:17,163 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-05 16:46:17,163 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1017049567] [2021-11-05 16:46:17,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 16:46:17,163 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-05 16:46:17,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-05 16:46:17,164 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-05 16:46:17,166 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-05 16:46:17,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 16:46:17,575 INFO L263 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-05 16:46:17,577 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-05 16:46:17,879 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-05 16:46:17,879 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-05 16:46:18,149 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-05 16:46:18,149 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-05 16:46:18,149 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1017049567] [2021-11-05 16:46:18,149 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1017049567] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-05 16:46:18,149 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-05 16:46:18,149 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-11-05 16:46:18,149 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691867635] [2021-11-05 16:46:18,149 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-05 16:46:18,150 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-05 16:46:18,150 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-05 16:46:18,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-05 16:46:18,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-05 16:46:18,150 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-05 16:46:18,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 16:46:18,394 INFO L93 Difference]: Finished difference Result 5151 states and 7391 transitions. [2021-11-05 16:46:18,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-05 16:46:18,395 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-05 16:46:18,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 16:46:18,403 INFO L225 Difference]: With dead ends: 5151 [2021-11-05 16:46:18,403 INFO L226 Difference]: Without dead ends: 2714 [2021-11-05 16:46:18,407 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.03ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-05 16:46:18,408 INFO L933 BasicCegarLoop]: 634 mSDtfsCounter, 90 mSDsluCounter, 589 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 166.25ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 1223 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.29ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 191.96ms IncrementalHoareTripleChecker+Time [2021-11-05 16:46:18,408 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [90 Valid, 1223 Invalid, 23 Unknown, 0 Unchecked, 1.29ms Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 191.96ms Time] [2021-11-05 16:46:18,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2714 states. [2021-11-05 16:46:18,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2714 to 2669. [2021-11-05 16:46:18,462 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-05 16:46:18,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2669 states to 2669 states and 3835 transitions. [2021-11-05 16:46:18,469 INFO L78 Accepts]: Start accepts. Automaton has 2669 states and 3835 transitions. Word has length 58 [2021-11-05 16:46:18,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 16:46:18,469 INFO L470 AbstractCegarLoop]: Abstraction has 2669 states and 3835 transitions. [2021-11-05 16:46:18,469 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-05 16:46:18,469 INFO L276 IsEmpty]: Start isEmpty. Operand 2669 states and 3835 transitions. [2021-11-05 16:46:18,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-11-05 16:46:18,472 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 16:46:18,472 INFO L514 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-05 16:46:18,487 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-05 16:46:18,687 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-05 16:46:18,687 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-05 16:46:18,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 16:46:18,687 INFO L85 PathProgramCache]: Analyzing trace with hash -1249517548, now seen corresponding path program 1 times [2021-11-05 16:46:18,688 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-05 16:46:18,688 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1639535360] [2021-11-05 16:46:18,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 16:46:18,688 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-05 16:46:18,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-05 16:46:18,691 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-05 16:46:18,728 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-05 16:46:19,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 16:46:19,111 INFO L263 TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-05 16:46:19,112 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-05 16:46:19,461 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-05 16:46:19,461 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-05 16:46:19,769 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-05 16:46:19,769 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-05 16:46:19,769 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1639535360] [2021-11-05 16:46:19,769 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1639535360] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-05 16:46:19,769 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-05 16:46:19,770 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-11-05 16:46:19,770 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086345267] [2021-11-05 16:46:19,770 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-05 16:46:19,770 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-05 16:46:19,770 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-05 16:46:19,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-05 16:46:19,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-05 16:46:19,770 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-05 16:46:21,849 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 16:46:22,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 16:46:22,162 INFO L93 Difference]: Finished difference Result 5647 states and 8181 transitions. [2021-11-05 16:46:22,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-05 16:46:22,162 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-05 16:46:22,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 16:46:22,171 INFO L225 Difference]: With dead ends: 5647 [2021-11-05 16:46:22,171 INFO L226 Difference]: Without dead ends: 2998 [2021-11-05 16:46:22,175 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 20.79ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-05 16:46:22,175 INFO L933 BasicCegarLoop]: 689 mSDtfsCounter, 440 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 12 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2220.56ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 440 SdHoareTripleChecker+Valid, 935 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.47ms SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2300.94ms IncrementalHoareTripleChecker+Time [2021-11-05 16:46:22,175 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [440 Valid, 935 Invalid, 35 Unknown, 0 Unchecked, 1.47ms Time], IncrementalHoareTripleChecker [12 Valid, 22 Invalid, 1 Unknown, 0 Unchecked, 2300.94ms Time] [2021-11-05 16:46:22,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2998 states. [2021-11-05 16:46:22,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2998 to 2991. [2021-11-05 16:46:22,229 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-05 16:46:22,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2991 states to 2991 states and 4321 transitions. [2021-11-05 16:46:22,235 INFO L78 Accepts]: Start accepts. Automaton has 2991 states and 4321 transitions. Word has length 72 [2021-11-05 16:46:22,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 16:46:22,236 INFO L470 AbstractCegarLoop]: Abstraction has 2991 states and 4321 transitions. [2021-11-05 16:46:22,236 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-05 16:46:22,236 INFO L276 IsEmpty]: Start isEmpty. Operand 2991 states and 4321 transitions. [2021-11-05 16:46:22,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-11-05 16:46:22,238 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 16:46:22,239 INFO L514 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-05 16:46:22,269 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-11-05 16:46:22,452 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-05 16:46:22,455 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-05 16:46:22,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 16:46:22,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1797171986, now seen corresponding path program 1 times [2021-11-05 16:46:22,457 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-05 16:46:22,457 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [252876865] [2021-11-05 16:46:22,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 16:46:22,457 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-05 16:46:22,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-05 16:46:22,458 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-05 16:46:22,460 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-05 16:46:22,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 16:46:22,852 INFO L263 TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-05 16:46:22,854 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-05 16:46:23,209 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-05 16:46:23,209 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-05 16:46:23,425 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-05 16:46:23,425 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-05 16:46:23,425 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [252876865] [2021-11-05 16:46:23,425 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [252876865] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-05 16:46:23,425 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-05 16:46:23,425 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2021-11-05 16:46:23,425 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795409900] [2021-11-05 16:46:23,425 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-05 16:46:23,425 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-05 16:46:23,426 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-05 16:46:23,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-05 16:46:23,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-05 16:46:23,426 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-05 16:46:24,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 16:46:24,223 INFO L93 Difference]: Finished difference Result 13473 states and 19609 transitions. [2021-11-05 16:46:24,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-05 16:46:24,224 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-05 16:46:24,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 16:46:24,253 INFO L225 Difference]: With dead ends: 13473 [2021-11-05 16:46:24,253 INFO L226 Difference]: Without dead ends: 10502 [2021-11-05 16:46:24,258 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 149.81ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-05 16:46:24,259 INFO L933 BasicCegarLoop]: 1040 mSDtfsCounter, 1591 mSDsluCounter, 1608 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 467.95ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1591 SdHoareTripleChecker+Valid, 2648 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.01ms SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 510.99ms IncrementalHoareTripleChecker+Time [2021-11-05 16:46:24,259 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1591 Valid, 2648 Invalid, 101 Unknown, 0 Unchecked, 6.01ms Time], IncrementalHoareTripleChecker [20 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 510.99ms Time] [2021-11-05 16:46:24,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10502 states. [2021-11-05 16:46:24,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10502 to 3039. [2021-11-05 16:46:24,404 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-05 16:46:24,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3039 states to 3039 states and 4369 transitions. [2021-11-05 16:46:24,410 INFO L78 Accepts]: Start accepts. Automaton has 3039 states and 4369 transitions. Word has length 72 [2021-11-05 16:46:24,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 16:46:24,410 INFO L470 AbstractCegarLoop]: Abstraction has 3039 states and 4369 transitions. [2021-11-05 16:46:24,410 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-05 16:46:24,411 INFO L276 IsEmpty]: Start isEmpty. Operand 3039 states and 4369 transitions. [2021-11-05 16:46:24,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-11-05 16:46:24,412 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 16:46:24,413 INFO L514 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-05 16:46:24,442 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-05 16:46:24,627 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-05 16:46:24,627 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-05 16:46:24,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 16:46:24,628 INFO L85 PathProgramCache]: Analyzing trace with hash -1074123766, now seen corresponding path program 1 times [2021-11-05 16:46:24,628 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-05 16:46:24,628 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [875132776] [2021-11-05 16:46:24,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 16:46:24,629 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-05 16:46:24,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-05 16:46:24,630 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-05 16:46:24,632 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-05 16:46:25,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 16:46:25,109 INFO L263 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-05 16:46:25,111 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-05 16:46:25,622 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-05 16:46:25,622 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-05 16:46:25,876 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-05 16:46:25,876 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-05 16:46:25,876 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [875132776] [2021-11-05 16:46:25,876 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [875132776] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-05 16:46:25,876 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-05 16:46:25,876 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 8 [2021-11-05 16:46:25,876 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553278323] [2021-11-05 16:46:25,876 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-05 16:46:25,877 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-05 16:46:25,877 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-05 16:46:25,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-05 16:46:25,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-11-05 16:46:25,877 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-05 16:46:28,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 16:46:28,679 INFO L93 Difference]: Finished difference Result 13017 states and 18949 transitions. [2021-11-05 16:46:28,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-05 16:46:28,680 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-05 16:46:28,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 16:46:28,707 INFO L225 Difference]: With dead ends: 13017 [2021-11-05 16:46:28,707 INFO L226 Difference]: Without dead ends: 9998 [2021-11-05 16:46:28,713 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 769.07ms TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2021-11-05 16:46:28,714 INFO L933 BasicCegarLoop]: 1515 mSDtfsCounter, 4567 mSDsluCounter, 5772 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1773.01ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 4567 SdHoareTripleChecker+Valid, 7287 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 10.01ms SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1936.92ms IncrementalHoareTripleChecker+Time [2021-11-05 16:46:28,714 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4567 Valid, 7287 Invalid, 383 Unknown, 0 Unchecked, 10.01ms Time], IncrementalHoareTripleChecker [40 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 1936.92ms Time] [2021-11-05 16:46:28,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9998 states. [2021-11-05 16:46:28,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9998 to 3087. [2021-11-05 16:46:28,913 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-05 16:46:28,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3087 states to 3087 states and 4393 transitions. [2021-11-05 16:46:28,920 INFO L78 Accepts]: Start accepts. Automaton has 3087 states and 4393 transitions. Word has length 75 [2021-11-05 16:46:28,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 16:46:28,920 INFO L470 AbstractCegarLoop]: Abstraction has 3087 states and 4393 transitions. [2021-11-05 16:46:28,920 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-05 16:46:28,920 INFO L276 IsEmpty]: Start isEmpty. Operand 3087 states and 4393 transitions. [2021-11-05 16:46:28,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-11-05 16:46:28,923 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 16:46:28,923 INFO L514 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-05 16:46:28,941 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-05 16:46:29,136 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-05 16:46:29,137 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-05 16:46:29,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 16:46:29,137 INFO L85 PathProgramCache]: Analyzing trace with hash 21460015, now seen corresponding path program 1 times [2021-11-05 16:46:29,138 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-05 16:46:29,138 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [417876752] [2021-11-05 16:46:29,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 16:46:29,138 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-05 16:46:29,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-05 16:46:29,148 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-05 16:46:29,149 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-05 16:46:29,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 16:46:29,577 INFO L263 TraceCheckSpWp]: Trace formula consists of 552 conjuncts, 21 conjunts are in the unsatisfiable core [2021-11-05 16:46:29,579 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-05 16:46:30,570 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-05 16:46:30,570 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-05 16:46:32,024 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-05 16:46:32,024 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-05 16:46:32,024 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [417876752] [2021-11-05 16:46:32,025 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [417876752] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-05 16:46:32,025 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-05 16:46:32,025 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 10] imperfect sequences [] total 18 [2021-11-05 16:46:32,025 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732473920] [2021-11-05 16:46:32,025 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-05 16:46:32,025 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-11-05 16:46:32,025 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-05 16:46:32,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-11-05 16:46:32,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2021-11-05 16:46:32,026 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-05 16:46:45,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 16:46:45,920 INFO L93 Difference]: Finished difference Result 21817 states and 31701 transitions. [2021-11-05 16:46:45,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-11-05 16:46:45,922 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-05 16:46:45,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 16:46:45,952 INFO L225 Difference]: With dead ends: 21817 [2021-11-05 16:46:45,952 INFO L226 Difference]: Without dead ends: 18750 [2021-11-05 16:46:45,960 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 5970.09ms TimeCoverageRelationStatistics Valid=505, Invalid=1387, Unknown=0, NotChecked=0, Total=1892 [2021-11-05 16:46:45,960 INFO L933 BasicCegarLoop]: 2001 mSDtfsCounter, 13227 mSDsluCounter, 22690 mSDsCounter, 0 mSdLazyCounter, 1407 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7880.87ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 13227 SdHoareTripleChecker+Valid, 24691 SdHoareTripleChecker+Invalid, 1459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 31.10ms SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 1407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8610.01ms IncrementalHoareTripleChecker+Time [2021-11-05 16:46:45,960 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13227 Valid, 24691 Invalid, 1459 Unknown, 0 Unchecked, 31.10ms Time], IncrementalHoareTripleChecker [52 Valid, 1407 Invalid, 0 Unknown, 0 Unchecked, 8610.01ms Time] [2021-11-05 16:46:45,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18750 states. [2021-11-05 16:46:46,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18750 to 3255. [2021-11-05 16:46:46,222 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-05 16:46:46,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3255 states to 3255 states and 4585 transitions. [2021-11-05 16:46:46,226 INFO L78 Accepts]: Start accepts. Automaton has 3255 states and 4585 transitions. Word has length 77 [2021-11-05 16:46:46,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 16:46:46,227 INFO L470 AbstractCegarLoop]: Abstraction has 3255 states and 4585 transitions. [2021-11-05 16:46:46,227 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-05 16:46:46,227 INFO L276 IsEmpty]: Start isEmpty. Operand 3255 states and 4585 transitions. [2021-11-05 16:46:46,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-11-05 16:46:46,233 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 16:46:46,233 INFO L514 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-05 16:46:46,250 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-05 16:46:46,451 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-05 16:46:46,451 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-05 16:46:46,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 16:46:46,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1164854511, now seen corresponding path program 1 times [2021-11-05 16:46:46,452 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-05 16:46:46,452 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [348100144] [2021-11-05 16:46:46,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 16:46:46,453 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-05 16:46:46,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-05 16:46:46,454 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-05 16:46:46,456 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-05 16:46:48,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 16:46:48,615 INFO L263 TraceCheckSpWp]: Trace formula consists of 628 conjuncts, 31 conjunts are in the unsatisfiable core [2021-11-05 16:46:48,618 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-05 16:46:48,821 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-05 16:46:53,469 INFO L354 Elim1Store]: treesize reduction 20, result has 31.0 percent of original size [2021-11-05 16:46:53,469 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-05 16:47:10,013 INFO L354 Elim1Store]: treesize reduction 74, result has 23.7 percent of original size [2021-11-05 16:47:10,014 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-05 16:47:10,098 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-05 16:47:27,506 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-05 16:47:27,519 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-05 16:47:55,194 INFO L354 Elim1Store]: treesize reduction 34, result has 12.8 percent of original size [2021-11-05 16:47:55,194 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-05 16:48:25,452 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-05 16:48:25,452 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-05 16:48:25,465 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-11-05 16:48:25,465 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-05 16:48:25,918 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-05 16:48:25,918 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-05 16:48:28,506 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-05 16:48:40,937 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_~tmp~12.base (let ((.cse1 (select |c_#memory_int| c_ULTIMATE.start_ldv_alloc_skb_12_~tmp~12.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-05 16:48:42,994 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_alloc_skb_12_~tmp~12.base (let ((.cse1 (store (store (select |c_#memory_int| c_ULTIMATE.start_ldv_alloc_skb_12_~tmp~12.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-05 16:48:45,091 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_#res.base| (let ((.cse1 (store (store (select |c_#memory_int| |c_ULTIMATE.start_ldv_skb_alloc_#res.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-05 16:48:47,136 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-05 16:48:56,734 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_#res.base| (let ((.cse2 (store (store (select .cse1 |c_ULTIMATE.start_ldv_zalloc_#res.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-05 16:48:58,809 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-05 16:49:00,919 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-05 16:49:03,178 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-05 16:49:11,189 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-05 16:49:22,141 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-05 16:49:40,636 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-05 16:49:40,636 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [348100144] [2021-11-05 16:49:40,637 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Index 1 out of bounds for length 1 [2021-11-05 16:49:40,637 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1349425200] [2021-11-05 16:49:40,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 16:49:40,637 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-11-05 16:49:40,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-11-05 16:49:40,639 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-05 16:49:40,640 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-05 16:49:41,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 16:49:41,632 INFO L263 TraceCheckSpWp]: Trace formula consists of 628 conjuncts, 30 conjunts are in the unsatisfiable core [2021-11-05 16:49:41,633 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@69dd818f [2021-11-05 16:49:41,634 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1536437413] [2021-11-05 16:49:41,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 16:49:41,634 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-05 16:49:41,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-05 16:49:41,635 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-05 16:49:41,636 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-05 16:49:41,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 16:49:42,016 INFO L263 TraceCheckSpWp]: Trace formula consists of 628 conjuncts, 30 conjunts are in the unsatisfiable core [2021-11-05 16:49:42,017 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@69dd818f [2021-11-05 16:49:42,017 INFO L186 FreeRefinementEngine]: Found 0 perfect and 0 imperfect interpolant sequences. [2021-11-05 16:49:42,017 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2021-11-05 16:49:42,017 ERROR L172 FreeRefinementEngine]: Strategy WOLF failed to provide any proof altough trace is infeasible [2021-11-05 16:49:42,018 INFO L628 BasicCegarLoop]: Counterexample might be feasible [2021-11-05 16:49:42,022 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-11-05 16:49:42,054 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-05 16:49:42,248 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-05 16:49:42,433 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-05 16:49:42,624 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-05 16:49:42,627 INFO L732 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 16:49:42,629 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-05 16:49:42,665 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.11 04:49:42 BoogieIcfgContainer [2021-11-05 16:49:42,665 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-05 16:49:42,666 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-05 16:49:42,666 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-05 16:49:42,666 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-05 16:49:42,667 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 04:46:08" (3/4) ... [2021-11-05 16:49:42,669 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-11-05 16:49:42,669 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-05 16:49:42,669 INFO L158 Benchmark]: Toolchain (without parser) took 227087.06ms. Allocated memory was 75.5MB in the beginning and 287.3MB in the end (delta: 211.8MB). Free memory was 42.7MB in the beginning and 110.4MB in the end (delta: -67.6MB). Peak memory consumption was 142.3MB. Max. memory is 16.1GB. [2021-11-05 16:49:42,670 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 48.2MB. Free memory was 30.3MB in the beginning and 30.2MB in the end (delta: 31.8kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-05 16:49:42,670 INFO L158 Benchmark]: CACSL2BoogieTranslator took 991.95ms. Allocated memory was 75.5MB in the beginning and 96.5MB in the end (delta: 21.0MB). Free memory was 42.6MB in the beginning and 44.6MB in the end (delta: -2.0MB). Peak memory consumption was 29.0MB. Max. memory is 16.1GB. [2021-11-05 16:49:42,670 INFO L158 Benchmark]: Boogie Procedure Inliner took 145.61ms. Allocated memory is still 96.5MB. Free memory was 44.6MB in the beginning and 48.4MB in the end (delta: -3.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2021-11-05 16:49:42,670 INFO L158 Benchmark]: Boogie Preprocessor took 146.21ms. Allocated memory is still 96.5MB. Free memory was 48.4MB in the beginning and 34.4MB in the end (delta: 14.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-11-05 16:49:42,671 INFO L158 Benchmark]: RCFGBuilder took 12079.41ms. Allocated memory was 96.5MB in the beginning and 239.1MB in the end (delta: 142.6MB). Free memory was 34.4MB in the beginning and 115.0MB in the end (delta: -80.6MB). Peak memory consumption was 95.9MB. Max. memory is 16.1GB. [2021-11-05 16:49:42,671 INFO L158 Benchmark]: TraceAbstraction took 213715.05ms. Allocated memory was 239.1MB in the beginning and 287.3MB in the end (delta: 48.2MB). Free memory was 114.0MB in the beginning and 110.4MB in the end (delta: 3.6MB). Peak memory consumption was 50.8MB. Max. memory is 16.1GB. [2021-11-05 16:49:42,671 INFO L158 Benchmark]: Witness Printer took 3.15ms. Allocated memory is still 287.3MB. Free memory is still 110.4MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-05 16:49:42,672 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.16ms. Allocated memory is still 48.2MB. Free memory was 30.3MB in the beginning and 30.2MB in the end (delta: 31.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 991.95ms. Allocated memory was 75.5MB in the beginning and 96.5MB in the end (delta: 21.0MB). Free memory was 42.6MB in the beginning and 44.6MB in the end (delta: -2.0MB). Peak memory consumption was 29.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 145.61ms. Allocated memory is still 96.5MB. Free memory was 44.6MB in the beginning and 48.4MB in the end (delta: -3.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 146.21ms. Allocated memory is still 96.5MB. Free memory was 48.4MB in the beginning and 34.4MB in the end (delta: 14.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * RCFGBuilder took 12079.41ms. Allocated memory was 96.5MB in the beginning and 239.1MB in the end (delta: 142.6MB). Free memory was 34.4MB in the beginning and 115.0MB in the end (delta: -80.6MB). Peak memory consumption was 95.9MB. Max. memory is 16.1GB. * TraceAbstraction took 213715.05ms. Allocated memory was 239.1MB in the beginning and 287.3MB in the end (delta: 48.2MB). Free memory was 114.0MB in the beginning and 110.4MB in the end (delta: 3.6MB). Peak memory consumption was 50.8MB. Max. memory is 16.1GB. * Witness Printer took 3.15ms. Allocated memory is still 287.3MB. Free memory is still 110.4MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.00ms ErrorAutomatonConstructionTimeTotal, 0.00ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.00ms ErrorAutomatonConstructionTimeAvg, 0.00ms ErrorAutomatonDifferenceTimeAvg, 0.00ms 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: 213619.68ms, OverallIterations: 10, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 40.22ms, AutomataDifference: 23652.98ms, DeadEndRemovalTime: 0.00ms, HoareAnnotationTime: 0.00ms, InitialAbstractionConstructionTime: 15.22ms, PartialOrderReductionTime: 0.00ms, HoareTripleCheckerStatistics: 2 mSolverCounterUnknown, 21652 SdHoareTripleChecker+Valid, 16556.02ms IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 21652 mSDsluCounter, 46602 SdHoareTripleChecker+Invalid, 15331.84ms Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 38228 mSDsCounter, 157 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2009 IncrementalHoareTripleChecker+Invalid, 2168 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 157 mSolverCounterUnsat, 8374 mSDtfsCounter, 2009 mSolverCounterSat, 68.42ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 959 GetRequests, 881 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 7680.55ms Time, 0.00ms 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.00ms DumpTime, AutomataMinimizationStatistics: 933.53ms AutomataMinimizationTime, 9 MinimizatonAttempts, 29921 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 411.77ms SsaConstructionTime, 3739.18ms SatisfiabilityAnalysisTime, 179547.09ms 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-05 16:49:42,771 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN