./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_safes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--arcnet--capmode.ko-entry_point.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c3fed411 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_safes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--arcnet--capmode.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 992626749f2e8ca84a93ad6fc64a197d6c8e66b412d995c24cf1e1136a1f2393 --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-18 03:59:48,340 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-18 03:59:48,342 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-18 03:59:48,366 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-18 03:59:48,367 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-18 03:59:48,369 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-18 03:59:48,370 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-18 03:59:48,372 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-18 03:59:48,374 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-18 03:59:48,377 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-18 03:59:48,377 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-18 03:59:48,378 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-18 03:59:48,378 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-18 03:59:48,380 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-18 03:59:48,382 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-18 03:59:48,383 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-18 03:59:48,384 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-18 03:59:48,384 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-18 03:59:48,387 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-18 03:59:48,391 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-18 03:59:48,392 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-18 03:59:48,393 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-18 03:59:48,394 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-18 03:59:48,394 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-18 03:59:48,399 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-18 03:59:48,399 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-18 03:59:48,399 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-18 03:59:48,400 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-18 03:59:48,401 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-18 03:59:48,401 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-18 03:59:48,402 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-18 03:59:48,403 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-18 03:59:48,404 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-18 03:59:48,405 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-18 03:59:48,405 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-18 03:59:48,405 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-18 03:59:48,406 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-18 03:59:48,406 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-18 03:59:48,406 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-18 03:59:48,407 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-18 03:59:48,407 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-18 03:59:48,408 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-12-18 03:59:48,434 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-18 03:59:48,436 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-18 03:59:48,436 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-18 03:59:48,436 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-18 03:59:48,437 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-18 03:59:48,437 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-18 03:59:48,438 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-18 03:59:48,438 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-18 03:59:48,438 INFO L138 SettingsManager]: * Use SBE=true [2021-12-18 03:59:48,438 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-18 03:59:48,439 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-18 03:59:48,439 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-18 03:59:48,439 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-18 03:59:48,439 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-18 03:59:48,439 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-18 03:59:48,440 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-18 03:59:48,440 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-18 03:59:48,440 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-18 03:59:48,440 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-18 03:59:48,440 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-18 03:59:48,440 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-18 03:59:48,440 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-18 03:59:48,440 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-18 03:59:48,441 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-18 03:59:48,441 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-18 03:59:48,441 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-18 03:59:48,441 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-18 03:59:48,441 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-18 03:59:48,441 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-18 03:59:48,441 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-18 03:59:48,442 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-18 03:59:48,442 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 -> 992626749f2e8ca84a93ad6fc64a197d6c8e66b412d995c24cf1e1136a1f2393 [2021-12-18 03:59:48,636 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-18 03:59:48,656 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-18 03:59:48,659 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-18 03:59:48,660 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-18 03:59:48,660 INFO L275 PluginConnector]: CDTParser initialized [2021-12-18 03:59:48,661 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_safes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--arcnet--capmode.ko-entry_point.cil.out.i [2021-12-18 03:59:48,732 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93a8e1199/7ce8f7096979459d8826b673fd1de514/FLAGafb737369 [2021-12-18 03:59:49,279 INFO L306 CDTParser]: Found 1 translation units. [2021-12-18 03:59:49,280 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_safes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--arcnet--capmode.ko-entry_point.cil.out.i [2021-12-18 03:59:49,303 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93a8e1199/7ce8f7096979459d8826b673fd1de514/FLAGafb737369 [2021-12-18 03:59:49,762 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93a8e1199/7ce8f7096979459d8826b673fd1de514 [2021-12-18 03:59:49,764 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-18 03:59:49,765 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-18 03:59:49,766 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-18 03:59:49,766 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-18 03:59:49,771 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-18 03:59:49,772 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 03:59:49" (1/1) ... [2021-12-18 03:59:49,773 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@bd8f8f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:59:49, skipping insertion in model container [2021-12-18 03:59:49,773 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 03:59:49" (1/1) ... [2021-12-18 03:59:49,777 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-18 03:59:49,842 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-18 03:59:50,326 WARN L230 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_safes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--arcnet--capmode.ko-entry_point.cil.out.i[154031,154044] [2021-12-18 03:59:50,467 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-18 03:59:50,480 INFO L203 MainTranslator]: Completed pre-run [2021-12-18 03:59:50,575 WARN L230 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_safes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--arcnet--capmode.ko-entry_point.cil.out.i[154031,154044] [2021-12-18 03:59:50,633 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-18 03:59:50,656 INFO L208 MainTranslator]: Completed translation [2021-12-18 03:59:50,657 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:59:50 WrapperNode [2021-12-18 03:59:50,658 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-18 03:59:50,659 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-18 03:59:50,659 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-18 03:59:50,659 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-18 03:59:50,665 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:59:50" (1/1) ... [2021-12-18 03:59:50,735 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:59:50" (1/1) ... [2021-12-18 03:59:50,777 INFO L137 Inliner]: procedures = 90, calls = 193, calls flagged for inlining = 27, calls inlined = 24, statements flattened = 546 [2021-12-18 03:59:50,780 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-18 03:59:50,781 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-18 03:59:50,781 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-18 03:59:50,781 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-18 03:59:50,787 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:59:50" (1/1) ... [2021-12-18 03:59:50,787 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:59:50" (1/1) ... [2021-12-18 03:59:50,803 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:59:50" (1/1) ... [2021-12-18 03:59:50,803 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:59:50" (1/1) ... [2021-12-18 03:59:50,836 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:59:50" (1/1) ... [2021-12-18 03:59:50,849 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:59:50" (1/1) ... [2021-12-18 03:59:50,862 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:59:50" (1/1) ... [2021-12-18 03:59:50,866 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-18 03:59:50,875 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-18 03:59:50,875 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-18 03:59:50,876 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-18 03:59:50,877 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:59:50" (1/1) ... [2021-12-18 03:59:50,883 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-18 03:59:50,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 03:59:50,904 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-12-18 03:59:50,924 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-12-18 03:59:50,938 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_free_int [2021-12-18 03:59:50,939 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_free_int [2021-12-18 03:59:50,939 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-18 03:59:50,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2021-12-18 03:59:50,939 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-18 03:59:50,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-18 03:59:50,939 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2021-12-18 03:59:50,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2021-12-18 03:59:50,940 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2021-12-18 03:59:50,940 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2021-12-18 03:59:50,940 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-18 03:59:50,940 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2021-12-18 03:59:50,940 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2021-12-18 03:59:50,940 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-18 03:59:50,941 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_set_remove [2021-12-18 03:59:50,941 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_set_remove [2021-12-18 03:59:50,941 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2021-12-18 03:59:50,941 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2021-12-18 03:59:50,941 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2021-12-18 03:59:50,941 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2021-12-18 03:59:50,941 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_alloc_skb_14 [2021-12-18 03:59:50,941 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_alloc_skb_14 [2021-12-18 03:59:50,942 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-18 03:59:50,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-12-18 03:59:50,942 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_alloc [2021-12-18 03:59:50,942 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_alloc [2021-12-18 03:59:50,942 INFO L130 BoogieDeclarations]: Found specification of procedure skb_put [2021-12-18 03:59:50,942 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_put [2021-12-18 03:59:50,942 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_successful_zalloc [2021-12-18 03:59:50,943 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_successful_zalloc [2021-12-18 03:59:50,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-18 03:59:50,943 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2021-12-18 03:59:50,943 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2021-12-18 03:59:50,943 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2021-12-18 03:59:50,943 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2021-12-18 03:59:50,943 INFO L130 BoogieDeclarations]: Found specification of procedure skb_mac_header [2021-12-18 03:59:50,944 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_mac_header [2021-12-18 03:59:50,944 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-12-18 03:59:50,944 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-12-18 03:59:50,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-18 03:59:50,944 INFO L130 BoogieDeclarations]: Found specification of procedure skb_reset_mac_header [2021-12-18 03:59:50,945 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_reset_mac_header [2021-12-18 03:59:50,945 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-18 03:59:50,945 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~int~X~int~X~$Pointer$~X~int~TO~VOID [2021-12-18 03:59:50,945 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~int~X~int~X~$Pointer$~X~int~TO~VOID [2021-12-18 03:59:50,945 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2021-12-18 03:59:50,945 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-18 03:59:50,945 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-18 03:59:51,204 INFO L236 CfgBuilder]: Building ICFG [2021-12-18 03:59:51,212 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-18 03:59:51,304 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2021-12-18 03:59:51,636 INFO L277 CfgBuilder]: Performing block encoding [2021-12-18 03:59:51,644 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-18 03:59:51,644 INFO L301 CfgBuilder]: Removed 3 assume(true) statements. [2021-12-18 03:59:51,646 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 03:59:51 BoogieIcfgContainer [2021-12-18 03:59:51,646 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-18 03:59:51,648 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-18 03:59:51,649 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-18 03:59:51,651 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-18 03:59:51,651 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 03:59:49" (1/3) ... [2021-12-18 03:59:51,652 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d36a311 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 03:59:51, skipping insertion in model container [2021-12-18 03:59:51,652 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:59:50" (2/3) ... [2021-12-18 03:59:51,652 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d36a311 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 03:59:51, skipping insertion in model container [2021-12-18 03:59:51,652 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 03:59:51" (3/3) ... [2021-12-18 03:59:51,653 INFO L111 eAbstractionObserver]: Analyzing ICFG 205_9a_array_safes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--arcnet--capmode.ko-entry_point.cil.out.i [2021-12-18 03:59:51,658 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-18 03:59:51,658 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-18 03:59:51,696 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-18 03:59:51,702 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-12-18 03:59:51,702 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-18 03:59:51,730 INFO L276 IsEmpty]: Start isEmpty. Operand has 227 states, 170 states have (on average 1.3647058823529412) internal successors, (232), 175 states have internal predecessors, (232), 40 states have call successors, (40), 16 states have call predecessors, (40), 15 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2021-12-18 03:59:51,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-18 03:59:51,736 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 03:59:51,736 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, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 03:59:51,737 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 03:59:51,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 03:59:51,741 INFO L85 PathProgramCache]: Analyzing trace with hash 1296188460, now seen corresponding path program 1 times [2021-12-18 03:59:51,749 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 03:59:51,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372259991] [2021-12-18 03:59:51,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 03:59:51,750 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 03:59:51,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 03:59:51,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 03:59:51,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 03:59:51,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 03:59:51,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 03:59:52,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 03:59:52,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 03:59:52,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 03:59:52,022 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 03:59:52,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372259991] [2021-12-18 03:59:52,024 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372259991] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 03:59:52,024 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 03:59:52,024 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-18 03:59:52,025 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542736257] [2021-12-18 03:59:52,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 03:59:52,030 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-18 03:59:52,030 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 03:59:52,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-18 03:59:52,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-18 03:59:52,059 INFO L87 Difference]: Start difference. First operand has 227 states, 170 states have (on average 1.3647058823529412) internal successors, (232), 175 states have internal predecessors, (232), 40 states have call successors, (40), 16 states have call predecessors, (40), 15 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-12-18 03:59:52,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 03:59:52,299 INFO L93 Difference]: Finished difference Result 464 states and 657 transitions. [2021-12-18 03:59:52,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-18 03:59:52,301 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 35 [2021-12-18 03:59:52,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 03:59:52,308 INFO L225 Difference]: With dead ends: 464 [2021-12-18 03:59:52,309 INFO L226 Difference]: Without dead ends: 232 [2021-12-18 03:59:52,312 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-18 03:59:52,314 INFO L933 BasicCegarLoop]: 289 mSDtfsCounter, 76 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 03:59:52,315 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [77 Valid, 466 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-18 03:59:52,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2021-12-18 03:59:52,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 217. [2021-12-18 03:59:52,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 165 states have (on average 1.303030303030303) internal successors, (215), 165 states have internal predecessors, (215), 37 states have call successors, (37), 15 states have call predecessors, (37), 14 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2021-12-18 03:59:52,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 288 transitions. [2021-12-18 03:59:52,350 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 288 transitions. Word has length 35 [2021-12-18 03:59:52,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 03:59:52,351 INFO L470 AbstractCegarLoop]: Abstraction has 217 states and 288 transitions. [2021-12-18 03:59:52,351 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-12-18 03:59:52,351 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 288 transitions. [2021-12-18 03:59:52,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-18 03:59:52,353 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 03:59:52,353 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, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 03:59:52,353 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-18 03:59:52,353 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 03:59:52,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 03:59:52,354 INFO L85 PathProgramCache]: Analyzing trace with hash 1162174954, now seen corresponding path program 1 times [2021-12-18 03:59:52,354 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 03:59:52,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248338486] [2021-12-18 03:59:52,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 03:59:52,355 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 03:59:52,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 03:59:52,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 03:59:52,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 03:59:52,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 03:59:52,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 03:59:52,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 03:59:52,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 03:59:52,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 03:59:52,433 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 03:59:52,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248338486] [2021-12-18 03:59:52,434 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248338486] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 03:59:52,434 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 03:59:52,434 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-18 03:59:52,434 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668618349] [2021-12-18 03:59:52,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 03:59:52,435 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-18 03:59:52,435 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 03:59:52,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-18 03:59:52,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-18 03:59:52,436 INFO L87 Difference]: Start difference. First operand 217 states and 288 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2021-12-18 03:59:52,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 03:59:52,808 INFO L93 Difference]: Finished difference Result 643 states and 867 transitions. [2021-12-18 03:59:52,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-18 03:59:52,808 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 35 [2021-12-18 03:59:52,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 03:59:52,812 INFO L225 Difference]: With dead ends: 643 [2021-12-18 03:59:52,812 INFO L226 Difference]: Without dead ends: 434 [2021-12-18 03:59:52,813 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-12-18 03:59:52,813 INFO L933 BasicCegarLoop]: 313 mSDtfsCounter, 379 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 404 SdHoareTripleChecker+Valid, 712 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-18 03:59:52,814 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [404 Valid, 712 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-18 03:59:52,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2021-12-18 03:59:52,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 404. [2021-12-18 03:59:52,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404 states, 305 states have (on average 1.301639344262295) internal successors, (397), 305 states have internal predecessors, (397), 70 states have call successors, (70), 29 states have call predecessors, (70), 28 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) [2021-12-18 03:59:52,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 536 transitions. [2021-12-18 03:59:52,837 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 536 transitions. Word has length 35 [2021-12-18 03:59:52,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 03:59:52,838 INFO L470 AbstractCegarLoop]: Abstraction has 404 states and 536 transitions. [2021-12-18 03:59:52,838 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2021-12-18 03:59:52,838 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 536 transitions. [2021-12-18 03:59:52,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-12-18 03:59:52,840 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 03:59:52,840 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 03:59:52,840 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-18 03:59:52,840 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 03:59:52,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 03:59:52,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1455096019, now seen corresponding path program 1 times [2021-12-18 03:59:52,841 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 03:59:52,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026706693] [2021-12-18 03:59:52,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 03:59:52,841 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 03:59:52,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 03:59:52,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 03:59:52,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 03:59:52,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 03:59:52,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 03:59:52,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 03:59:52,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 03:59:52,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 03:59:52,899 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 03:59:52,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026706693] [2021-12-18 03:59:52,899 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026706693] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 03:59:52,899 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 03:59:52,899 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-18 03:59:52,900 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279122768] [2021-12-18 03:59:52,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 03:59:52,900 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-18 03:59:52,900 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 03:59:52,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-18 03:59:52,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-18 03:59:52,901 INFO L87 Difference]: Start difference. First operand 404 states and 536 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2021-12-18 03:59:53,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 03:59:53,159 INFO L93 Difference]: Finished difference Result 834 states and 1118 transitions. [2021-12-18 03:59:53,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-18 03:59:53,159 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 41 [2021-12-18 03:59:53,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 03:59:53,162 INFO L225 Difference]: With dead ends: 834 [2021-12-18 03:59:53,162 INFO L226 Difference]: Without dead ends: 438 [2021-12-18 03:59:53,163 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-18 03:59:53,164 INFO L933 BasicCegarLoop]: 274 mSDtfsCounter, 42 mSDsluCounter, 558 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 832 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 03:59:53,164 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 832 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-18 03:59:53,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2021-12-18 03:59:53,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 405. [2021-12-18 03:59:53,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 306 states have (on average 1.3006535947712419) internal successors, (398), 306 states have internal predecessors, (398), 70 states have call successors, (70), 29 states have call predecessors, (70), 28 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) [2021-12-18 03:59:53,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 537 transitions. [2021-12-18 03:59:53,191 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 537 transitions. Word has length 41 [2021-12-18 03:59:53,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 03:59:53,192 INFO L470 AbstractCegarLoop]: Abstraction has 405 states and 537 transitions. [2021-12-18 03:59:53,192 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2021-12-18 03:59:53,192 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 537 transitions. [2021-12-18 03:59:53,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-12-18 03:59:53,193 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 03:59:53,193 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 03:59:53,193 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-18 03:59:53,194 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 03:59:53,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 03:59:53,194 INFO L85 PathProgramCache]: Analyzing trace with hash -1093757940, now seen corresponding path program 1 times [2021-12-18 03:59:53,194 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 03:59:53,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532429306] [2021-12-18 03:59:53,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 03:59:53,195 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 03:59:53,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 03:59:53,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 03:59:53,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 03:59:53,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 03:59:53,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 03:59:53,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 03:59:53,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 03:59:53,278 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 03:59:53,278 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 03:59:53,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532429306] [2021-12-18 03:59:53,278 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532429306] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 03:59:53,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [18619110] [2021-12-18 03:59:53,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 03:59:53,279 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 03:59:53,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 03:59:53,280 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-12-18 03:59:53,329 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-12-18 03:59:53,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 03:59:53,445 INFO L263 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-18 03:59:53,448 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 03:59:53,543 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 03:59:53,543 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 03:59:53,632 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 03:59:53,632 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [18619110] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 03:59:53,633 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 03:59:53,633 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 9 [2021-12-18 03:59:53,633 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871886331] [2021-12-18 03:59:53,633 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 03:59:53,634 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-18 03:59:53,634 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 03:59:53,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-18 03:59:53,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2021-12-18 03:59:53,634 INFO L87 Difference]: Start difference. First operand 405 states and 537 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 7 states have internal predecessors, (51), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2021-12-18 03:59:53,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 03:59:53,833 INFO L93 Difference]: Finished difference Result 844 states and 1132 transitions. [2021-12-18 03:59:53,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-18 03:59:53,834 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 7 states have internal predecessors, (51), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 45 [2021-12-18 03:59:53,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 03:59:53,836 INFO L225 Difference]: With dead ends: 844 [2021-12-18 03:59:53,836 INFO L226 Difference]: Without dead ends: 447 [2021-12-18 03:59:53,837 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2021-12-18 03:59:53,838 INFO L933 BasicCegarLoop]: 274 mSDtfsCounter, 99 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 682 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 03:59:53,838 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [100 Valid, 682 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-18 03:59:53,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2021-12-18 03:59:53,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 417. [2021-12-18 03:59:53,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 318 states have (on average 1.29874213836478) internal successors, (413), 318 states have internal predecessors, (413), 70 states have call successors, (70), 29 states have call predecessors, (70), 28 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) [2021-12-18 03:59:53,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 552 transitions. [2021-12-18 03:59:53,856 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 552 transitions. Word has length 45 [2021-12-18 03:59:53,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 03:59:53,856 INFO L470 AbstractCegarLoop]: Abstraction has 417 states and 552 transitions. [2021-12-18 03:59:53,856 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 7 states have internal predecessors, (51), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2021-12-18 03:59:53,856 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 552 transitions. [2021-12-18 03:59:53,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-12-18 03:59:53,858 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 03:59:53,858 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 03:59:53,884 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-12-18 03:59:54,074 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 03:59:54,075 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 03:59:54,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 03:59:54,075 INFO L85 PathProgramCache]: Analyzing trace with hash 797749943, now seen corresponding path program 2 times [2021-12-18 03:59:54,076 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 03:59:54,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901387608] [2021-12-18 03:59:54,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 03:59:54,076 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 03:59:54,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 03:59:54,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 03:59:54,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 03:59:54,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 03:59:54,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 03:59:54,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 03:59:54,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 03:59:54,164 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2021-12-18 03:59:54,165 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 03:59:54,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901387608] [2021-12-18 03:59:54,165 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901387608] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 03:59:54,165 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 03:59:54,165 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-18 03:59:54,165 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591727398] [2021-12-18 03:59:54,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 03:59:54,166 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 03:59:54,167 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 03:59:54,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 03:59:54,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-18 03:59:54,167 INFO L87 Difference]: Start difference. First operand 417 states and 552 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2021-12-18 03:59:54,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 03:59:54,562 INFO L93 Difference]: Finished difference Result 855 states and 1142 transitions. [2021-12-18 03:59:54,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-18 03:59:54,563 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 57 [2021-12-18 03:59:54,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 03:59:54,566 INFO L225 Difference]: With dead ends: 855 [2021-12-18 03:59:54,566 INFO L226 Difference]: Without dead ends: 446 [2021-12-18 03:59:54,567 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-12-18 03:59:54,568 INFO L933 BasicCegarLoop]: 404 mSDtfsCounter, 440 mSDsluCounter, 748 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 465 SdHoareTripleChecker+Valid, 1152 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-18 03:59:54,569 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [465 Valid, 1152 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-18 03:59:54,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2021-12-18 03:59:54,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 416. [2021-12-18 03:59:54,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 317 states have (on average 1.2902208201892744) internal successors, (409), 317 states have internal predecessors, (409), 70 states have call successors, (70), 29 states have call predecessors, (70), 28 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) [2021-12-18 03:59:54,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 548 transitions. [2021-12-18 03:59:54,595 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 548 transitions. Word has length 57 [2021-12-18 03:59:54,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 03:59:54,595 INFO L470 AbstractCegarLoop]: Abstraction has 416 states and 548 transitions. [2021-12-18 03:59:54,595 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2021-12-18 03:59:54,595 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 548 transitions. [2021-12-18 03:59:54,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-12-18 03:59:54,597 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 03:59:54,598 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 03:59:54,598 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-18 03:59:54,598 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 03:59:54,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 03:59:54,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1188095234, now seen corresponding path program 1 times [2021-12-18 03:59:54,599 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 03:59:54,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227028301] [2021-12-18 03:59:54,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 03:59:54,599 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 03:59:54,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 03:59:54,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 03:59:54,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 03:59:54,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 03:59:54,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 03:59:54,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 03:59:54,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 03:59:54,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-18 03:59:54,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 03:59:54,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 03:59:54,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 03:59:54,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 03:59:54,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 03:59:54,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-18 03:59:54,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 03:59:54,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 03:59:54,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 03:59:54,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 03:59:54,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 03:59:54,795 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2021-12-18 03:59:54,795 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 03:59:54,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227028301] [2021-12-18 03:59:54,795 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227028301] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 03:59:54,795 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 03:59:54,796 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-18 03:59:54,796 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599392973] [2021-12-18 03:59:54,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 03:59:54,796 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-18 03:59:54,796 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 03:59:54,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-18 03:59:54,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-18 03:59:54,799 INFO L87 Difference]: Start difference. First operand 416 states and 548 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-18 03:59:55,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 03:59:55,192 INFO L93 Difference]: Finished difference Result 1279 states and 1734 transitions. [2021-12-18 03:59:55,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-18 03:59:55,193 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 98 [2021-12-18 03:59:55,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 03:59:55,197 INFO L225 Difference]: With dead ends: 1279 [2021-12-18 03:59:55,197 INFO L226 Difference]: Without dead ends: 866 [2021-12-18 03:59:55,198 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2021-12-18 03:59:55,199 INFO L933 BasicCegarLoop]: 313 mSDtfsCounter, 370 mSDsluCounter, 976 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 394 SdHoareTripleChecker+Valid, 1289 SdHoareTripleChecker+Invalid, 449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-18 03:59:55,199 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [394 Valid, 1289 Invalid, 449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-18 03:59:55,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 866 states. [2021-12-18 03:59:55,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 866 to 808. [2021-12-18 03:59:55,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 808 states, 613 states have (on average 1.2903752039151712) internal successors, (791), 613 states have internal predecessors, (791), 138 states have call successors, (138), 57 states have call predecessors, (138), 56 states have return successors, (149), 137 states have call predecessors, (149), 137 states have call successors, (149) [2021-12-18 03:59:55,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 1078 transitions. [2021-12-18 03:59:55,225 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 1078 transitions. Word has length 98 [2021-12-18 03:59:55,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 03:59:55,226 INFO L470 AbstractCegarLoop]: Abstraction has 808 states and 1078 transitions. [2021-12-18 03:59:55,226 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-18 03:59:55,226 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 1078 transitions. [2021-12-18 03:59:55,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2021-12-18 03:59:55,231 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 03:59:55,231 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 03:59:55,231 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-18 03:59:55,232 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 03:59:55,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 03:59:55,232 INFO L85 PathProgramCache]: Analyzing trace with hash -2043442978, now seen corresponding path program 1 times [2021-12-18 03:59:55,232 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 03:59:55,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285615656] [2021-12-18 03:59:55,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 03:59:55,233 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 03:59:55,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 03:59:55,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 03:59:55,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 03:59:55,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 03:59:55,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 03:59:55,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 03:59:55,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 03:59:55,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-18 03:59:55,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 03:59:55,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 03:59:55,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 03:59:55,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 03:59:55,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 03:59:55,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-18 03:59:55,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 03:59:55,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 03:59:55,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 03:59:55,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 03:59:55,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 03:59:55,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2021-12-18 03:59:55,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 03:59:55,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2021-12-18 03:59:55,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 03:59:55,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 03:59:55,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 03:59:55,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 03:59:55,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 03:59:55,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 03:59:55,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 03:59:55,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 03:59:55,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 03:59:55,462 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2021-12-18 03:59:55,462 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 03:59:55,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285615656] [2021-12-18 03:59:55,462 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285615656] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 03:59:55,463 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 03:59:55,463 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-12-18 03:59:55,463 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422555360] [2021-12-18 03:59:55,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 03:59:55,463 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-18 03:59:55,463 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 03:59:55,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-18 03:59:55,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2021-12-18 03:59:55,464 INFO L87 Difference]: Start difference. First operand 808 states and 1078 transitions. Second operand has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 8 states have internal predecessors, (82), 4 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (11), 6 states have call predecessors, (11), 3 states have call successors, (11) [2021-12-18 03:59:55,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 03:59:55,872 INFO L93 Difference]: Finished difference Result 1660 states and 2258 transitions. [2021-12-18 03:59:55,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-18 03:59:55,873 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 8 states have internal predecessors, (82), 4 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (11), 6 states have call predecessors, (11), 3 states have call successors, (11) Word has length 149 [2021-12-18 03:59:55,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 03:59:55,876 INFO L225 Difference]: With dead ends: 1660 [2021-12-18 03:59:55,876 INFO L226 Difference]: Without dead ends: 860 [2021-12-18 03:59:55,878 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2021-12-18 03:59:55,878 INFO L933 BasicCegarLoop]: 258 mSDtfsCounter, 94 mSDsluCounter, 1975 mSDsCounter, 0 mSdLazyCounter, 521 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 2233 SdHoareTripleChecker+Invalid, 604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-18 03:59:55,878 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [97 Valid, 2233 Invalid, 604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 521 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-18 03:59:55,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 860 states. [2021-12-18 03:59:55,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 860 to 818. [2021-12-18 03:59:55,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 818 states, 619 states have (on average 1.2746365105008077) internal successors, (789), 621 states have internal predecessors, (789), 138 states have call successors, (138), 57 states have call predecessors, (138), 60 states have return successors, (155), 139 states have call predecessors, (155), 137 states have call successors, (155) [2021-12-18 03:59:55,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 818 states to 818 states and 1082 transitions. [2021-12-18 03:59:55,910 INFO L78 Accepts]: Start accepts. Automaton has 818 states and 1082 transitions. Word has length 149 [2021-12-18 03:59:55,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 03:59:55,911 INFO L470 AbstractCegarLoop]: Abstraction has 818 states and 1082 transitions. [2021-12-18 03:59:55,911 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 8 states have internal predecessors, (82), 4 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (11), 6 states have call predecessors, (11), 3 states have call successors, (11) [2021-12-18 03:59:55,911 INFO L276 IsEmpty]: Start isEmpty. Operand 818 states and 1082 transitions. [2021-12-18 03:59:55,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2021-12-18 03:59:55,918 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 03:59:55,919 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 03:59:55,919 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-18 03:59:55,919 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 03:59:55,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 03:59:55,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1151008919, now seen corresponding path program 1 times [2021-12-18 03:59:55,920 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 03:59:55,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393982151] [2021-12-18 03:59:55,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 03:59:55,920 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 03:59:55,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 03:59:56,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 03:59:56,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 03:59:56,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 03:59:56,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 03:59:56,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 03:59:56,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 03:59:56,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-18 03:59:56,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 03:59:56,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 03:59:56,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 03:59:56,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 03:59:56,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 03:59:56,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-18 03:59:56,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 03:59:56,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 03:59:56,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 03:59:56,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 03:59:56,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 03:59:56,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2021-12-18 03:59:56,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 03:59:56,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2021-12-18 03:59:56,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 03:59:56,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 03:59:56,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 03:59:56,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 03:59:56,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 03:59:56,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 03:59:56,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 03:59:56,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 03:59:56,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 03:59:56,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-12-18 03:59:56,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 03:59:56,105 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 7 proven. 28 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2021-12-18 03:59:56,105 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 03:59:56,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393982151] [2021-12-18 03:59:56,106 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393982151] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 03:59:56,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2013317283] [2021-12-18 03:59:56,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 03:59:56,106 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 03:59:56,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 03:59:56,107 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-12-18 03:59:56,108 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-12-18 03:59:56,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 03:59:56,313 INFO L263 TraceCheckSpWp]: Trace formula consists of 939 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-18 03:59:56,316 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 03:59:56,490 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 49 proven. 28 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2021-12-18 03:59:56,490 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 03:59:56,716 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 7 proven. 28 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2021-12-18 03:59:56,717 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2013317283] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 03:59:56,717 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 03:59:56,717 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 15 [2021-12-18 03:59:56,717 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472051167] [2021-12-18 03:59:56,717 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 03:59:56,718 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-12-18 03:59:56,718 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 03:59:56,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-18 03:59:56,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2021-12-18 03:59:56,719 INFO L87 Difference]: Start difference. First operand 818 states and 1082 transitions. Second operand has 15 states, 15 states have (on average 9.733333333333333) internal successors, (146), 11 states have internal predecessors, (146), 2 states have call successors, (28), 6 states have call predecessors, (28), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2021-12-18 03:59:57,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 03:59:57,064 INFO L93 Difference]: Finished difference Result 1329 states and 1792 transitions. [2021-12-18 03:59:57,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-18 03:59:57,064 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 9.733333333333333) internal successors, (146), 11 states have internal predecessors, (146), 2 states have call successors, (28), 6 states have call predecessors, (28), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 155 [2021-12-18 03:59:57,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 03:59:57,067 INFO L225 Difference]: With dead ends: 1329 [2021-12-18 03:59:57,067 INFO L226 Difference]: Without dead ends: 892 [2021-12-18 03:59:57,068 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 334 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2021-12-18 03:59:57,069 INFO L933 BasicCegarLoop]: 264 mSDtfsCounter, 101 mSDsluCounter, 1135 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 1399 SdHoareTripleChecker+Invalid, 461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-18 03:59:57,069 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [102 Valid, 1399 Invalid, 461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 403 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-18 03:59:57,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 892 states. [2021-12-18 03:59:57,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 892 to 850. [2021-12-18 03:59:57,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 850 states, 651 states have (on average 1.273425499231951) internal successors, (829), 653 states have internal predecessors, (829), 138 states have call successors, (138), 57 states have call predecessors, (138), 60 states have return successors, (155), 139 states have call predecessors, (155), 137 states have call successors, (155) [2021-12-18 03:59:57,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 850 states to 850 states and 1122 transitions. [2021-12-18 03:59:57,093 INFO L78 Accepts]: Start accepts. Automaton has 850 states and 1122 transitions. Word has length 155 [2021-12-18 03:59:57,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 03:59:57,093 INFO L470 AbstractCegarLoop]: Abstraction has 850 states and 1122 transitions. [2021-12-18 03:59:57,093 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 9.733333333333333) internal successors, (146), 11 states have internal predecessors, (146), 2 states have call successors, (28), 6 states have call predecessors, (28), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2021-12-18 03:59:57,094 INFO L276 IsEmpty]: Start isEmpty. Operand 850 states and 1122 transitions. [2021-12-18 03:59:57,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2021-12-18 03:59:57,096 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 03:59:57,096 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 03:59:57,115 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-12-18 03:59:57,310 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,SelfDestructingSolverStorable7 [2021-12-18 03:59:57,310 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 03:59:57,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 03:59:57,311 INFO L85 PathProgramCache]: Analyzing trace with hash 745918541, now seen corresponding path program 2 times [2021-12-18 03:59:57,311 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 03:59:57,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618858750] [2021-12-18 03:59:57,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 03:59:57,311 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 03:59:57,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 03:59:57,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 03:59:57,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 03:59:57,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 03:59:57,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 03:59:57,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 03:59:57,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 03:59:57,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-18 03:59:57,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 03:59:57,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 03:59:57,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 03:59:57,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 03:59:57,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 03:59:57,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2021-12-18 03:59:57,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 03:59:57,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 03:59:57,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 03:59:57,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 03:59:57,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 03:59:57,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2021-12-18 03:59:57,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 03:59:57,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2021-12-18 03:59:57,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 03:59:57,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 03:59:57,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 03:59:57,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 03:59:57,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 03:59:57,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 03:59:57,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 03:59:57,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 03:59:57,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 03:59:57,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-12-18 03:59:57,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 03:59:57,477 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 213 trivial. 0 not checked. [2021-12-18 03:59:57,477 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 03:59:57,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618858750] [2021-12-18 03:59:57,477 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618858750] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 03:59:57,477 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 03:59:57,477 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-18 03:59:57,477 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821366375] [2021-12-18 03:59:57,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 03:59:57,478 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-18 03:59:57,478 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 03:59:57,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-18 03:59:57,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-12-18 03:59:57,479 INFO L87 Difference]: Start difference. First operand 850 states and 1122 transitions. Second operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (11), 6 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2021-12-18 03:59:57,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 03:59:57,793 INFO L93 Difference]: Finished difference Result 1736 states and 2321 transitions. [2021-12-18 03:59:57,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-18 03:59:57,794 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (11), 6 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 171 [2021-12-18 03:59:57,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 03:59:57,797 INFO L225 Difference]: With dead ends: 1736 [2021-12-18 03:59:57,797 INFO L226 Difference]: Without dead ends: 893 [2021-12-18 03:59:57,798 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-12-18 03:59:57,799 INFO L933 BasicCegarLoop]: 267 mSDtfsCounter, 56 mSDsluCounter, 827 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 1094 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-18 03:59:57,799 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 1094 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-18 03:59:57,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 893 states. [2021-12-18 03:59:57,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 893 to 851. [2021-12-18 03:59:57,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 851 states, 652 states have (on average 1.2730061349693251) internal successors, (830), 654 states have internal predecessors, (830), 138 states have call successors, (138), 57 states have call predecessors, (138), 60 states have return successors, (155), 139 states have call predecessors, (155), 137 states have call successors, (155) [2021-12-18 03:59:57,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 851 states to 851 states and 1123 transitions. [2021-12-18 03:59:57,820 INFO L78 Accepts]: Start accepts. Automaton has 851 states and 1123 transitions. Word has length 171 [2021-12-18 03:59:57,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 03:59:57,820 INFO L470 AbstractCegarLoop]: Abstraction has 851 states and 1123 transitions. [2021-12-18 03:59:57,820 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (11), 6 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2021-12-18 03:59:57,821 INFO L276 IsEmpty]: Start isEmpty. Operand 851 states and 1123 transitions. [2021-12-18 03:59:57,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2021-12-18 03:59:57,823 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 03:59:57,823 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 03:59:57,823 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-18 03:59:57,823 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 03:59:57,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 03:59:57,824 INFO L85 PathProgramCache]: Analyzing trace with hash -595602417, now seen corresponding path program 1 times [2021-12-18 03:59:57,824 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 03:59:57,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960660630] [2021-12-18 03:59:57,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 03:59:57,824 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 03:59:57,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-18 03:59:57,904 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-18 03:59:57,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-18 03:59:58,028 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-18 03:59:58,028 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-18 03:59:58,028 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-18 03:59:58,030 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-18 03:59:58,032 INFO L732 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1] [2021-12-18 03:59:58,034 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-18 03:59:58,047 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,048 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,048 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,048 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,049 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,049 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,049 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,049 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,049 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,050 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,050 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,050 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,050 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,050 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,050 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,051 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,051 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,051 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,051 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,051 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,051 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,051 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,052 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,052 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,052 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,052 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,052 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,052 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,053 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,053 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,053 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,053 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,053 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,053 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,053 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,054 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,054 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,054 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,054 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,054 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,054 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,054 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,055 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,055 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,055 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,059 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,059 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,059 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,059 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,060 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,060 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,060 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,060 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,060 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,060 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,060 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,060 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,061 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,061 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,061 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,061 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,061 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,061 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,061 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,062 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,062 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,062 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,062 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,062 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,062 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,062 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,063 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,063 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,063 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,063 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,063 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,063 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,063 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,063 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,064 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,065 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,065 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,066 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,066 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,066 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,066 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,066 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,066 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,066 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,066 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,067 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,067 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,067 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,067 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,073 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,073 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,073 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,073 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,073 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,073 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,074 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,074 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,074 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,074 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,074 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,074 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,074 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,074 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,075 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,075 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,075 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,075 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,075 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,075 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,075 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,076 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,076 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,076 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,076 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,076 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,076 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,076 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,077 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,077 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,077 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,077 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,077 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,078 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,078 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,078 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,078 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,078 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,078 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,079 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,079 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,079 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,079 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,079 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,079 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,080 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,095 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,095 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,095 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,096 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,096 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,096 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,096 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,096 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,096 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,096 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,096 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,097 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,097 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,097 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,097 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,097 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,097 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,097 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,097 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,098 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,098 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,098 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,098 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,098 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,098 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,098 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,099 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,099 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,099 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,099 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,099 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,099 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,099 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,099 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,100 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,100 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,100 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,100 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,100 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,100 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,100 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,101 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,101 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,101 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,101 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,101 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,101 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,101 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,102 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,102 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,102 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,103 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,103 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,103 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,103 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,103 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,103 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,103 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,104 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,104 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,104 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,104 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,105 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,105 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,105 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,105 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,105 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,105 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,105 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,105 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,106 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,106 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,106 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,106 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,106 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,106 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,106 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,107 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,107 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,107 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,107 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,107 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,107 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,107 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,108 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,108 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,108 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,108 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,108 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,108 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,108 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,108 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,109 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,109 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,109 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,109 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,109 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,109 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,109 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,110 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,110 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,110 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,110 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,110 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,110 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,110 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,111 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,111 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,111 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,111 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,111 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,111 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,112 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,112 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,112 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,112 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,112 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,112 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,114 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,114 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,114 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,114 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,115 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,115 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,115 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,115 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,115 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,115 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,115 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,116 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,116 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,116 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,116 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,116 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,116 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,116 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,117 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,117 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,117 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,117 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,117 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,117 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,117 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,118 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,118 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,118 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,118 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,118 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,118 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,118 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,119 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,119 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,119 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,119 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,119 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,119 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,119 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,120 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,120 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,120 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,120 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,120 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,120 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,120 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,121 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,121 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,121 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,121 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,121 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,121 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,121 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,122 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,122 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,122 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,122 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,122 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,122 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,122 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,123 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,123 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,123 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,123 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,123 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,123 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,123 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 03:59:58,124 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 03:59:58,194 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 03:59:58 BoogieIcfgContainer [2021-12-18 03:59:58,194 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-18 03:59:58,194 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-18 03:59:58,194 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-18 03:59:58,195 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-18 03:59:58,195 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 03:59:51" (3/4) ... [2021-12-18 03:59:58,197 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-12-18 03:59:58,197 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-18 03:59:58,197 INFO L158 Benchmark]: Toolchain (without parser) took 8432.52ms. Allocated memory was 107.0MB in the beginning and 312.5MB in the end (delta: 205.5MB). Free memory was 83.6MB in the beginning and 248.8MB in the end (delta: -165.2MB). Peak memory consumption was 38.6MB. Max. memory is 16.1GB. [2021-12-18 03:59:58,198 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 107.0MB. Free memory is still 87.0MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-18 03:59:58,198 INFO L158 Benchmark]: CACSL2BoogieTranslator took 892.31ms. Allocated memory was 107.0MB in the beginning and 140.5MB in the end (delta: 33.6MB). Free memory was 83.3MB in the beginning and 66.5MB in the end (delta: 16.8MB). Peak memory consumption was 50.0MB. Max. memory is 16.1GB. [2021-12-18 03:59:58,198 INFO L158 Benchmark]: Boogie Procedure Inliner took 120.96ms. Allocated memory is still 140.5MB. Free memory was 66.0MB in the beginning and 95.3MB in the end (delta: -29.3MB). Peak memory consumption was 12.4MB. Max. memory is 16.1GB. [2021-12-18 03:59:58,198 INFO L158 Benchmark]: Boogie Preprocessor took 93.66ms. Allocated memory is still 140.5MB. Free memory was 95.3MB in the beginning and 90.9MB in the end (delta: 4.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-12-18 03:59:58,198 INFO L158 Benchmark]: RCFGBuilder took 771.25ms. Allocated memory is still 140.5MB. Free memory was 90.9MB in the beginning and 82.4MB in the end (delta: 8.4MB). Peak memory consumption was 42.1MB. Max. memory is 16.1GB. [2021-12-18 03:59:58,199 INFO L158 Benchmark]: TraceAbstraction took 6545.50ms. Allocated memory was 140.5MB in the beginning and 312.5MB in the end (delta: 172.0MB). Free memory was 81.6MB in the beginning and 248.8MB in the end (delta: -167.2MB). Peak memory consumption was 177.9MB. Max. memory is 16.1GB. [2021-12-18 03:59:58,199 INFO L158 Benchmark]: Witness Printer took 2.73ms. Allocated memory is still 312.5MB. Free memory is still 248.8MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-18 03:59:58,200 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.17ms. Allocated memory is still 107.0MB. Free memory is still 87.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 892.31ms. Allocated memory was 107.0MB in the beginning and 140.5MB in the end (delta: 33.6MB). Free memory was 83.3MB in the beginning and 66.5MB in the end (delta: 16.8MB). Peak memory consumption was 50.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 120.96ms. Allocated memory is still 140.5MB. Free memory was 66.0MB in the beginning and 95.3MB in the end (delta: -29.3MB). Peak memory consumption was 12.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 93.66ms. Allocated memory is still 140.5MB. Free memory was 95.3MB in the beginning and 90.9MB in the end (delta: 4.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 771.25ms. Allocated memory is still 140.5MB. Free memory was 90.9MB in the beginning and 82.4MB in the end (delta: 8.4MB). Peak memory consumption was 42.1MB. Max. memory is 16.1GB. * TraceAbstraction took 6545.50ms. Allocated memory was 140.5MB in the beginning and 312.5MB in the end (delta: 172.0MB). Free memory was 81.6MB in the beginning and 248.8MB in the end (delta: -167.2MB). Peak memory consumption was 177.9MB. Max. memory is 16.1GB. * Witness Printer took 2.73ms. Allocated memory is still 312.5MB. Free memory is still 248.8MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 5354]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 5431. Possible FailurePath: [L5377] int LDV_IN_INTERRUPT = 1; [L5378] int ref_cnt ; [L5379] int ldv_state_variable_1 ; [L5380] struct archdr *capmode_proto_group0 ; [L5381] int ldv_state_variable_0 ; [L5382] struct net_device *capmode_proto_group1 ; [L5586-L5588] static struct ArcProto capmode_proto = {114, 508, 0, & rx, & build_header, & prepare_tx, (int (*)(struct net_device * , int ))0, & ack_tx}; [L5630] int ldv_retval_0 ; [L5845] Element set_impl[15] ; [L5846] int last_index = 0; [L5980] Set LDV_SKBS ; VAL [capmode_proto={16:0}, capmode_proto_group0={0:0}, capmode_proto_group1={0:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=0, ldv_state_variable_1=0, ref_cnt=0, set_impl={17:0}] [L5647] int ldvarg7 ; [L5648] int tmp ; [L5649] struct sk_buff *ldvarg3 ; [L5650] void *tmp___0 ; [L5651] int ldvarg0 ; [L5652] int tmp___1 ; [L5653] int ldvarg5 ; [L5654] int tmp___2 ; [L5655] int ldvarg6 ; [L5656] int tmp___3 ; [L5657] int ldvarg1 ; [L5658] int tmp___4 ; [L5659] unsigned short ldvarg4 ; [L5660] unsigned short tmp___5 ; [L5661] uint8_t ldvarg2 ; [L5662] int tmp___6 ; [L5663] int tmp___7 ; [L5664] int tmp___8 ; [L5666] tmp = __VERIFIER_nondet_int() [L5667] ldvarg7 = tmp VAL [capmode_proto={16:0}, capmode_proto_group0={0:0}, capmode_proto_group1={0:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=0, ldv_state_variable_1=0, ldvarg2={18446744073709551618:0}, ldvarg7=-2, ref_cnt=0, set_impl={17:0}, tmp=-2] [L5668] CALL, EXPR ldv_successful_zalloc(232UL) VAL [\old(__size)=232, capmode_proto={16:0}, capmode_proto_group0={0:0}, capmode_proto_group1={0:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=0, ldv_state_variable_1=0, ref_cnt=0, set_impl={17:0}] [L5296] EXPR, FCALL calloc(1UL, __size) VAL [\old(__size)=232, __size=232, calloc(1UL, __size)={-3:0}, capmode_proto={16:0}, capmode_proto_group0={0:0}, capmode_proto_group1={0:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=0, ldv_state_variable_1=0, ref_cnt=0, set_impl={17:0}] [L5296] void *p = calloc(1UL, __size); VAL [\old(__size)=232, __size=232, calloc(1UL, __size)={-3:0}, capmode_proto={16:0}, capmode_proto_group0={0:0}, capmode_proto_group1={0:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=0, ldv_state_variable_1=0, p={-3:0}, ref_cnt=0, set_impl={17:0}] [L5297] CALL assume_abort_if_not(p != (void *)0) VAL [\old(cond)=1, capmode_proto={16:0}, capmode_proto_group0={0:0}, capmode_proto_group1={0:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=0, ldv_state_variable_1=0, ref_cnt=0, set_impl={17:0}] [L5293] COND FALSE !(!cond) VAL [\old(cond)=1, capmode_proto={16:0}, capmode_proto_group0={0:0}, capmode_proto_group1={0:0}, cond=1, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=0, ldv_state_variable_1=0, ref_cnt=0, set_impl={17:0}] [L5297] RET assume_abort_if_not(p != (void *)0) VAL [\old(__size)=232, __size=232, calloc(1UL, __size)={-3:0}, capmode_proto={16:0}, capmode_proto_group0={0:0}, capmode_proto_group1={0:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=0, ldv_state_variable_1=0, p={-3:0}, ref_cnt=0, set_impl={17:0}] [L5298] return p; VAL [\old(__size)=232, \result={-3:0}, __size=232, calloc(1UL, __size)={-3:0}, capmode_proto={16:0}, capmode_proto_group0={0:0}, capmode_proto_group1={0:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=0, ldv_state_variable_1=0, p={-3:0}, ref_cnt=0, set_impl={17:0}] [L5668] RET, EXPR ldv_successful_zalloc(232UL) VAL [capmode_proto={16:0}, capmode_proto_group0={0:0}, capmode_proto_group1={0:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_successful_zalloc(232UL)={-3:0}, ldvarg2={18446744073709551618:0}, ldvarg7=-2, ref_cnt=0, set_impl={17:0}, tmp=-2] [L5668] tmp___0 = ldv_successful_zalloc(232UL) [L5669] ldvarg3 = (struct sk_buff *)tmp___0 [L5670] tmp___1 = __VERIFIER_nondet_int() [L5671] ldvarg0 = tmp___1 [L5672] tmp___2 = __VERIFIER_nondet_int() [L5673] ldvarg5 = tmp___2 [L5674] tmp___3 = __VERIFIER_nondet_int() [L5675] ldvarg6 = tmp___3 [L5676] tmp___4 = __VERIFIER_nondet_int() [L5677] ldvarg1 = tmp___4 [L5678] tmp___5 = __VERIFIER_nondet_ushort() [L5679] ldvarg4 = tmp___5 [L5680] CALL ldv_initialize() [L5999] CALL ldv_set_init(LDV_SKBS) [L5851] set = set_impl [L5852] last_index = 0 VAL [capmode_proto={16:0}, capmode_proto_group0={0:0}, capmode_proto_group1={0:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=0, ldv_state_variable_1=0, ref_cnt=0, set={0:0}, set={17:0}, set_impl={17:0}] [L5999] RET ldv_set_init(LDV_SKBS) [L5680] RET ldv_initialize() [L5681] FCALL memset((void *)(& ldvarg2), 0, 1UL) [L5682] ldv_state_variable_1 = 0 [L5683] ref_cnt = 0 [L5684] ldv_state_variable_0 = 1 VAL [capmode_proto={16:0}, capmode_proto_group0={0:0}, capmode_proto_group1={0:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=1, ldv_state_variable_1=0, ldvarg0=257, ldvarg1=0, ldvarg2={18446744073709551618:0}, ldvarg3={-3:0}, ldvarg4=3, ldvarg5=0, ldvarg6=-4, ldvarg7=-2, ref_cnt=0, set_impl={17:0}, tmp=-2, tmp___0={-3:0}, tmp___1=257, tmp___2=0, tmp___3=-4, tmp___4=0, tmp___5=3] [L5686] tmp___6 = __VERIFIER_nondet_int() [L5688] case 0: [L5727] case 1: VAL [capmode_proto={16:0}, capmode_proto_group0={0:0}, capmode_proto_group1={0:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=1, ldv_state_variable_1=0, ldvarg0=257, ldvarg1=0, ldvarg2={18446744073709551618:0}, ldvarg3={-3:0}, ldvarg4=3, ldvarg5=0, ldvarg6=-4, ldvarg7=-2, ref_cnt=0, set_impl={17:0}, tmp=-2, tmp___0={-3:0}, tmp___1=257, tmp___2=0, tmp___3=-4, tmp___4=0, tmp___5=3, tmp___6=1] [L5728] COND TRUE ldv_state_variable_0 != 0 [L5729] tmp___8 = __VERIFIER_nondet_int() [L5731] case 0: [L5739] case 1: VAL [capmode_proto={16:0}, capmode_proto_group0={0:0}, capmode_proto_group1={0:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=1, ldv_state_variable_1=0, ldvarg0=257, ldvarg1=0, ldvarg2={18446744073709551618:0}, ldvarg3={-3:0}, ldvarg4=3, ldvarg5=0, ldvarg6=-4, ldvarg7=-2, ref_cnt=0, set_impl={17:0}, tmp=-2, tmp___0={-3:0}, tmp___1=257, tmp___2=0, tmp___3=-4, tmp___4=0, tmp___5=3, tmp___6=1, tmp___8=1] [L5740] COND TRUE ldv_state_variable_0 == 1 [L5741] CALL, EXPR capmode_module_init() [L5619] CALL arcnet_cap_init() [L5591] int count ; [L5593] count = 1 VAL [capmode_proto={16:0}, capmode_proto_group0={0:0}, capmode_proto_group1={0:0}, count=1, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=1, ldv_state_variable_1=0, ref_cnt=0, set_impl={17:0}] [L5602] COND TRUE count <= 8 VAL [capmode_proto={16:0}, capmode_proto_group0={0:0}, capmode_proto_group1={0:0}, count=1, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=1, ldv_state_variable_1=0, ref_cnt=0, set_impl={17:0}] [L5596] EXPR arc_proto_map[count] VAL [arc_proto_map={18446744073709551624:10}, arc_proto_map[count]={0:0}, capmode_proto={16:0}, capmode_proto_group0={0:0}, capmode_proto_group1={0:0}, count=1, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=1, ldv_state_variable_1=0, ref_cnt=0, set_impl={17:0}] [L5596] COND TRUE (unsigned long )arc_proto_map[count] == (unsigned long )arc_proto_default [L5597] arc_proto_map[count] = & capmode_proto VAL [arc_proto_default={0:0}, arc_proto_map={18446744073709551624:10}, capmode_proto={16:0}, capmode_proto_group0={0:0}, capmode_proto_group1={0:0}, count=1, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=1, ldv_state_variable_1=0, ref_cnt=0, set_impl={17:0}] [L5600] count = count + 1 VAL [arc_proto_default={0:0}, arc_proto_map={18446744073709551624:10}, capmode_proto={16:0}, capmode_proto_group0={0:0}, capmode_proto_group1={0:0}, count=2, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=1, ldv_state_variable_1=0, ref_cnt=0, set_impl={17:0}] [L5602] COND TRUE count <= 8 VAL [arc_proto_default={0:0}, arc_proto_map={18446744073709551624:10}, capmode_proto={16:0}, capmode_proto_group0={0:0}, capmode_proto_group1={0:0}, count=2, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=1, ldv_state_variable_1=0, ref_cnt=0, set_impl={17:0}] [L5596] EXPR arc_proto_map[count] VAL [arc_proto_default={0:0}, arc_proto_map={18446744073709551624:10}, arc_proto_map[count]={18446744073709551597:19}, capmode_proto={16:0}, capmode_proto_group0={0:0}, capmode_proto_group1={0:0}, count=2, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=1, ldv_state_variable_1=0, ref_cnt=0, set_impl={17:0}] [L5596] COND TRUE (unsigned long )arc_proto_map[count] == (unsigned long )arc_proto_default [L5597] arc_proto_map[count] = & capmode_proto VAL [arc_proto_default={0:0}, arc_proto_map={18446744073709551624:10}, capmode_proto={16:0}, capmode_proto_group0={0:0}, capmode_proto_group1={0:0}, count=2, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=1, ldv_state_variable_1=0, ref_cnt=0, set_impl={17:0}] [L5600] count = count + 1 VAL [arc_proto_default={0:0}, arc_proto_map={18446744073709551624:10}, capmode_proto={16:0}, capmode_proto_group0={0:0}, capmode_proto_group1={0:0}, count=3, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=1, ldv_state_variable_1=0, ref_cnt=0, set_impl={17:0}] [L5602] COND TRUE count <= 8 VAL [arc_proto_default={0:0}, arc_proto_map={18446744073709551624:10}, capmode_proto={16:0}, capmode_proto_group0={0:0}, capmode_proto_group1={0:0}, count=3, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=1, ldv_state_variable_1=0, ref_cnt=0, set_impl={17:0}] [L5596] EXPR arc_proto_map[count] VAL [arc_proto_default={0:0}, arc_proto_map={18446744073709551624:10}, arc_proto_map[count]={18446744073709551595:21}, capmode_proto={16:0}, capmode_proto_group0={0:0}, capmode_proto_group1={0:0}, count=3, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=1, ldv_state_variable_1=0, ref_cnt=0, set_impl={17:0}] [L5596] COND TRUE (unsigned long )arc_proto_map[count] == (unsigned long )arc_proto_default [L5597] arc_proto_map[count] = & capmode_proto VAL [arc_proto_default={0:0}, arc_proto_map={18446744073709551624:10}, capmode_proto={16:0}, capmode_proto_group0={0:0}, capmode_proto_group1={0:0}, count=3, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=1, ldv_state_variable_1=0, ref_cnt=0, set_impl={17:0}] [L5600] count = count + 1 VAL [arc_proto_default={0:0}, arc_proto_map={18446744073709551624:10}, capmode_proto={16:0}, capmode_proto_group0={0:0}, capmode_proto_group1={0:0}, count=4, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=1, ldv_state_variable_1=0, ref_cnt=0, set_impl={17:0}] [L5602] COND TRUE count <= 8 VAL [arc_proto_default={0:0}, arc_proto_map={18446744073709551624:10}, capmode_proto={16:0}, capmode_proto_group0={0:0}, capmode_proto_group1={0:0}, count=4, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=1, ldv_state_variable_1=0, ref_cnt=0, set_impl={17:0}] [L5596] EXPR arc_proto_map[count] VAL [arc_proto_default={0:0}, arc_proto_map={18446744073709551624:10}, arc_proto_map[count]={18446744073709551594:22}, capmode_proto={16:0}, capmode_proto_group0={0:0}, capmode_proto_group1={0:0}, count=4, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=1, ldv_state_variable_1=0, ref_cnt=0, set_impl={17:0}] [L5596] COND TRUE (unsigned long )arc_proto_map[count] == (unsigned long )arc_proto_default [L5597] arc_proto_map[count] = & capmode_proto VAL [arc_proto_default={0:0}, arc_proto_map={18446744073709551624:10}, capmode_proto={16:0}, capmode_proto_group0={0:0}, capmode_proto_group1={0:0}, count=4, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=1, ldv_state_variable_1=0, ref_cnt=0, set_impl={17:0}] [L5600] count = count + 1 VAL [arc_proto_default={0:0}, arc_proto_map={18446744073709551624:10}, capmode_proto={16:0}, capmode_proto_group0={0:0}, capmode_proto_group1={0:0}, count=5, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=1, ldv_state_variable_1=0, ref_cnt=0, set_impl={17:0}] [L5602] COND TRUE count <= 8 VAL [arc_proto_default={0:0}, arc_proto_map={18446744073709551624:10}, capmode_proto={16:0}, capmode_proto_group0={0:0}, capmode_proto_group1={0:0}, count=5, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=1, ldv_state_variable_1=0, ref_cnt=0, set_impl={17:0}] [L5596] EXPR arc_proto_map[count] VAL [arc_proto_default={0:0}, arc_proto_map={18446744073709551624:10}, arc_proto_map[count]={18446744073709551593:23}, capmode_proto={16:0}, capmode_proto_group0={0:0}, capmode_proto_group1={0:0}, count=5, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=1, ldv_state_variable_1=0, ref_cnt=0, set_impl={17:0}] [L5596] COND TRUE (unsigned long )arc_proto_map[count] == (unsigned long )arc_proto_default [L5597] arc_proto_map[count] = & capmode_proto VAL [arc_proto_default={0:0}, arc_proto_map={18446744073709551624:10}, capmode_proto={16:0}, capmode_proto_group0={0:0}, capmode_proto_group1={0:0}, count=5, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=1, ldv_state_variable_1=0, ref_cnt=0, set_impl={17:0}] [L5600] count = count + 1 VAL [arc_proto_default={0:0}, arc_proto_map={18446744073709551624:10}, capmode_proto={16:0}, capmode_proto_group0={0:0}, capmode_proto_group1={0:0}, count=6, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=1, ldv_state_variable_1=0, ref_cnt=0, set_impl={17:0}] [L5602] COND TRUE count <= 8 VAL [arc_proto_default={0:0}, arc_proto_map={18446744073709551624:10}, capmode_proto={16:0}, capmode_proto_group0={0:0}, capmode_proto_group1={0:0}, count=6, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=1, ldv_state_variable_1=0, ref_cnt=0, set_impl={17:0}] [L5596] EXPR arc_proto_map[count] VAL [arc_proto_default={0:0}, arc_proto_map={18446744073709551624:10}, arc_proto_map[count]={18446744073709551592:24}, capmode_proto={16:0}, capmode_proto_group0={0:0}, capmode_proto_group1={0:0}, count=6, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=1, ldv_state_variable_1=0, ref_cnt=0, set_impl={17:0}] [L5596] COND TRUE (unsigned long )arc_proto_map[count] == (unsigned long )arc_proto_default [L5597] arc_proto_map[count] = & capmode_proto VAL [arc_proto_default={0:0}, arc_proto_map={18446744073709551624:10}, capmode_proto={16:0}, capmode_proto_group0={0:0}, capmode_proto_group1={0:0}, count=6, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=1, ldv_state_variable_1=0, ref_cnt=0, set_impl={17:0}] [L5600] count = count + 1 VAL [arc_proto_default={0:0}, arc_proto_map={18446744073709551624:10}, capmode_proto={16:0}, capmode_proto_group0={0:0}, capmode_proto_group1={0:0}, count=7, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=1, ldv_state_variable_1=0, ref_cnt=0, set_impl={17:0}] [L5602] COND TRUE count <= 8 VAL [arc_proto_default={0:0}, arc_proto_map={18446744073709551624:10}, capmode_proto={16:0}, capmode_proto_group0={0:0}, capmode_proto_group1={0:0}, count=7, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=1, ldv_state_variable_1=0, ref_cnt=0, set_impl={17:0}] [L5596] EXPR arc_proto_map[count] VAL [arc_proto_default={0:0}, arc_proto_map={18446744073709551624:10}, arc_proto_map[count]={18446744073709551589:27}, capmode_proto={16:0}, capmode_proto_group0={0:0}, capmode_proto_group1={0:0}, count=7, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=1, ldv_state_variable_1=0, ref_cnt=0, set_impl={17:0}] [L5596] COND TRUE (unsigned long )arc_proto_map[count] == (unsigned long )arc_proto_default [L5597] arc_proto_map[count] = & capmode_proto VAL [arc_proto_default={0:0}, arc_proto_map={18446744073709551624:10}, capmode_proto={16:0}, capmode_proto_group0={0:0}, capmode_proto_group1={0:0}, count=7, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=1, ldv_state_variable_1=0, ref_cnt=0, set_impl={17:0}] [L5600] count = count + 1 VAL [arc_proto_default={0:0}, arc_proto_map={18446744073709551624:10}, capmode_proto={16:0}, capmode_proto_group0={0:0}, capmode_proto_group1={0:0}, count=8, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=1, ldv_state_variable_1=0, ref_cnt=0, set_impl={17:0}] [L5602] COND TRUE count <= 8 VAL [arc_proto_default={0:0}, arc_proto_map={18446744073709551624:10}, capmode_proto={16:0}, capmode_proto_group0={0:0}, capmode_proto_group1={0:0}, count=8, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=1, ldv_state_variable_1=0, ref_cnt=0, set_impl={17:0}] [L5596] EXPR arc_proto_map[count] VAL [arc_proto_default={0:0}, arc_proto_map={18446744073709551624:10}, arc_proto_map[count]={18446744073709551588:28}, capmode_proto={16:0}, capmode_proto_group0={0:0}, capmode_proto_group1={0:0}, count=8, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=1, ldv_state_variable_1=0, ref_cnt=0, set_impl={17:0}] [L5596] COND TRUE (unsigned long )arc_proto_map[count] == (unsigned long )arc_proto_default [L5597] arc_proto_map[count] = & capmode_proto VAL [arc_proto_default={0:0}, arc_proto_map={18446744073709551624:10}, capmode_proto={16:0}, capmode_proto_group0={0:0}, capmode_proto_group1={0:0}, count=8, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=1, ldv_state_variable_1=0, ref_cnt=0, set_impl={17:0}] [L5600] count = count + 1 VAL [arc_proto_default={0:0}, arc_proto_map={18446744073709551624:10}, capmode_proto={16:0}, capmode_proto_group0={0:0}, capmode_proto_group1={0:0}, count=9, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=1, ldv_state_variable_1=0, ref_cnt=0, set_impl={17:0}] [L5602] COND FALSE !(count <= 8) VAL [arc_proto_default={0:0}, arc_proto_map={18446744073709551624:10}, capmode_proto={16:0}, capmode_proto_group0={0:0}, capmode_proto_group1={0:0}, count=9, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=1, ldv_state_variable_1=0, ref_cnt=0, set_impl={17:0}] [L5606] COND TRUE (unsigned long )arc_bcast_proto == (unsigned long )arc_proto_default [L5607] arc_bcast_proto = & capmode_proto VAL [arc_bcast_proto={16:0}, arc_proto_default={0:0}, arc_proto_map={18446744073709551624:10}, capmode_proto={16:0}, capmode_proto_group0={0:0}, capmode_proto_group1={0:0}, count=9, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=1, ldv_state_variable_1=0, ref_cnt=0, set_impl={17:0}] [L5610] arc_proto_default = & capmode_proto [L5611] arc_raw_proto = & capmode_proto VAL [arc_bcast_proto={16:0}, arc_proto_default={16:0}, arc_proto_map={18446744073709551624:10}, arc_raw_proto={16:0}, capmode_proto={16:0}, capmode_proto_group0={0:0}, capmode_proto_group1={0:0}, count=9, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=1, ldv_state_variable_1=0, ref_cnt=0, set_impl={17:0}] [L5619] RET arcnet_cap_init() [L5620] return (0); VAL [\result=0, arc_bcast_proto={16:0}, arc_proto_default={16:0}, arc_proto_map={18446744073709551624:10}, arc_raw_proto={16:0}, capmode_proto={16:0}, capmode_proto_group0={0:0}, capmode_proto_group1={0:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=1, ldv_state_variable_1=0, ref_cnt=0, set_impl={17:0}] [L5741] RET, EXPR capmode_module_init() [L5741] ldv_retval_0 = capmode_module_init() [L5742] COND TRUE ldv_retval_0 == 0 [L5743] ldv_state_variable_0 = 3 [L5744] ldv_state_variable_1 = 1 [L5745] CALL ldv_initialize_ArcProto_1() [L5635] void *tmp ; [L5636] void *tmp___0 ; VAL [arc_bcast_proto={16:0}, arc_proto_default={16:0}, arc_proto_map={18446744073709551624:10}, arc_raw_proto={16:0}, capmode_proto={16:0}, capmode_proto_group0={0:0}, capmode_proto_group1={0:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, set_impl={17:0}] [L5638] CALL, EXPR ldv_successful_zalloc(20UL) VAL [\old(__size)=20, arc_bcast_proto={16:0}, arc_proto_default={16:0}, arc_proto_map={18446744073709551624:10}, arc_raw_proto={16:0}, capmode_proto={16:0}, capmode_proto_group0={0:0}, capmode_proto_group1={0:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, set_impl={17:0}] [L5296] EXPR, FCALL calloc(1UL, __size) VAL [\old(__size)=20, __size=20, arc_bcast_proto={16:0}, arc_proto_default={16:0}, arc_proto_map={18446744073709551624:10}, arc_raw_proto={16:0}, calloc(1UL, __size)={-5:0}, capmode_proto={16:0}, capmode_proto_group0={0:0}, capmode_proto_group1={0:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, set_impl={17:0}] [L5296] void *p = calloc(1UL, __size); VAL [\old(__size)=20, __size=20, arc_bcast_proto={16:0}, arc_proto_default={16:0}, arc_proto_map={18446744073709551624:10}, arc_raw_proto={16:0}, calloc(1UL, __size)={-5:0}, capmode_proto={16:0}, capmode_proto_group0={0:0}, capmode_proto_group1={0:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, p={-5:0}, ref_cnt=0, set_impl={17:0}] [L5297] CALL assume_abort_if_not(p != (void *)0) VAL [\old(cond)=1, arc_bcast_proto={16:0}, arc_proto_default={16:0}, arc_proto_map={18446744073709551624:10}, arc_raw_proto={16:0}, capmode_proto={16:0}, capmode_proto_group0={0:0}, capmode_proto_group1={0:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, set_impl={17:0}] [L5293] COND FALSE !(!cond) VAL [\old(cond)=1, arc_bcast_proto={16:0}, arc_proto_default={16:0}, arc_proto_map={18446744073709551624:10}, arc_raw_proto={16:0}, capmode_proto={16:0}, capmode_proto_group0={0:0}, capmode_proto_group1={0:0}, cond=1, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, set_impl={17:0}] [L5297] RET assume_abort_if_not(p != (void *)0) VAL [\old(__size)=20, __size=20, arc_bcast_proto={16:0}, arc_proto_default={16:0}, arc_proto_map={18446744073709551624:10}, arc_raw_proto={16:0}, calloc(1UL, __size)={-5:0}, capmode_proto={16:0}, capmode_proto_group0={0:0}, capmode_proto_group1={0:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, p={-5:0}, ref_cnt=0, set_impl={17:0}] [L5298] return p; VAL [\old(__size)=20, \result={-5:0}, __size=20, arc_bcast_proto={16:0}, arc_proto_default={16:0}, arc_proto_map={18446744073709551624:10}, arc_raw_proto={16:0}, calloc(1UL, __size)={-5:0}, capmode_proto={16:0}, capmode_proto_group0={0:0}, capmode_proto_group1={0:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, p={-5:0}, ref_cnt=0, set_impl={17:0}] [L5638] RET, EXPR ldv_successful_zalloc(20UL) VAL [arc_bcast_proto={16:0}, arc_proto_default={16:0}, arc_proto_map={18446744073709551624:10}, arc_raw_proto={16:0}, capmode_proto={16:0}, capmode_proto_group0={0:0}, capmode_proto_group1={0:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_successful_zalloc(20UL)={-5:0}, ref_cnt=0, set_impl={17:0}] [L5638] tmp = ldv_successful_zalloc(20UL) [L5639] capmode_proto_group0 = (struct archdr *)tmp VAL [arc_bcast_proto={16:0}, arc_proto_default={16:0}, arc_proto_map={18446744073709551624:10}, arc_raw_proto={16:0}, capmode_proto={16:0}, capmode_proto_group0={-5:0}, capmode_proto_group1={0:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, set_impl={17:0}, tmp={-5:0}] [L5640] CALL, EXPR ldv_successful_zalloc(3264UL) VAL [\old(__size)=3264, arc_bcast_proto={16:0}, arc_proto_default={16:0}, arc_proto_map={18446744073709551624:10}, arc_raw_proto={16:0}, capmode_proto={16:0}, capmode_proto_group0={-5:0}, capmode_proto_group1={0:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, set_impl={17:0}] [L5296] EXPR, FCALL calloc(1UL, __size) VAL [\old(__size)=3264, __size=3264, arc_bcast_proto={16:0}, arc_proto_default={16:0}, arc_proto_map={18446744073709551624:10}, arc_raw_proto={16:0}, calloc(1UL, __size)={-6:0}, capmode_proto={16:0}, capmode_proto_group0={-5:0}, capmode_proto_group1={0:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, set_impl={17:0}] [L5296] void *p = calloc(1UL, __size); VAL [\old(__size)=3264, __size=3264, arc_bcast_proto={16:0}, arc_proto_default={16:0}, arc_proto_map={18446744073709551624:10}, arc_raw_proto={16:0}, calloc(1UL, __size)={-6:0}, capmode_proto={16:0}, capmode_proto_group0={-5:0}, capmode_proto_group1={0:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, p={-6:0}, ref_cnt=0, set_impl={17:0}] [L5297] CALL assume_abort_if_not(p != (void *)0) VAL [\old(cond)=1, arc_bcast_proto={16:0}, arc_proto_default={16:0}, arc_proto_map={18446744073709551624:10}, arc_raw_proto={16:0}, capmode_proto={16:0}, capmode_proto_group0={-5:0}, capmode_proto_group1={0:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, set_impl={17:0}] [L5293] COND FALSE !(!cond) VAL [\old(cond)=1, arc_bcast_proto={16:0}, arc_proto_default={16:0}, arc_proto_map={18446744073709551624:10}, arc_raw_proto={16:0}, capmode_proto={16:0}, capmode_proto_group0={-5:0}, capmode_proto_group1={0:0}, cond=1, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, set_impl={17:0}] [L5297] RET assume_abort_if_not(p != (void *)0) VAL [\old(__size)=3264, __size=3264, arc_bcast_proto={16:0}, arc_proto_default={16:0}, arc_proto_map={18446744073709551624:10}, arc_raw_proto={16:0}, calloc(1UL, __size)={-6:0}, capmode_proto={16:0}, capmode_proto_group0={-5:0}, capmode_proto_group1={0:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, p={-6:0}, ref_cnt=0, set_impl={17:0}] [L5298] return p; VAL [\old(__size)=3264, \result={-6:0}, __size=3264, arc_bcast_proto={16:0}, arc_proto_default={16:0}, arc_proto_map={18446744073709551624:10}, arc_raw_proto={16:0}, calloc(1UL, __size)={-6:0}, capmode_proto={16:0}, capmode_proto_group0={-5:0}, capmode_proto_group1={0:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, p={-6:0}, ref_cnt=0, set_impl={17:0}] [L5640] RET, EXPR ldv_successful_zalloc(3264UL) VAL [arc_bcast_proto={16:0}, arc_proto_default={16:0}, arc_proto_map={18446744073709551624:10}, arc_raw_proto={16:0}, capmode_proto={16:0}, capmode_proto_group0={-5:0}, capmode_proto_group1={0:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_successful_zalloc(3264UL)={-6:0}, ref_cnt=0, set_impl={17:0}, tmp={-5:0}] [L5640] tmp___0 = ldv_successful_zalloc(3264UL) [L5641] capmode_proto_group1 = (struct net_device *)tmp___0 VAL [arc_bcast_proto={16:0}, arc_proto_default={16:0}, arc_proto_map={18446744073709551624:10}, arc_raw_proto={16:0}, capmode_proto={16:0}, capmode_proto_group0={-5:0}, capmode_proto_group1={-6:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, set_impl={17:0}, tmp={-5:0}, tmp___0={-6:0}] [L5745] RET ldv_initialize_ArcProto_1() [L5748] COND FALSE !(ldv_retval_0 != 0) VAL [arc_bcast_proto={16:0}, arc_proto_default={16:0}, arc_proto_map={18446744073709551624:10}, arc_raw_proto={16:0}, capmode_proto={16:0}, capmode_proto_group0={-5:0}, capmode_proto_group1={-6:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldvarg0=257, ldvarg1=0, ldvarg2={18446744073709551618:0}, ldvarg3={-3:0}, ldvarg4=3, ldvarg5=0, ldvarg6=-4, ldvarg7=-2, ref_cnt=0, set_impl={17:0}, tmp=-2, tmp___0={-3:0}, tmp___1=257, tmp___2=0, tmp___3=-4, tmp___4=0, tmp___5=3, tmp___6=1, tmp___8=1] [L5686] tmp___6 = __VERIFIER_nondet_int() [L5688] case 0: VAL [arc_bcast_proto={16:0}, arc_proto_default={16:0}, arc_proto_map={18446744073709551624:10}, arc_raw_proto={16:0}, capmode_proto={16:0}, capmode_proto_group0={-5:0}, capmode_proto_group1={-6:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldvarg0=257, ldvarg1=0, ldvarg2={18446744073709551618:0}, ldvarg3={-3:0}, ldvarg4=3, ldvarg5=0, ldvarg6=-4, ldvarg7=-2, ref_cnt=0, set_impl={17:0}, tmp=-2, tmp___0={-3:0}, tmp___1=257, tmp___2=0, tmp___3=-4, tmp___4=0, tmp___5=3, tmp___6=0, tmp___8=1] [L5689] COND TRUE ldv_state_variable_1 != 0 [L5690] tmp___7 = __VERIFIER_nondet_int() [L5692] case 0: [L5699] case 1: [L5706] case 2: [L5713] case 3: VAL [arc_bcast_proto={16:0}, arc_proto_default={16:0}, arc_proto_map={18446744073709551624:10}, arc_raw_proto={16:0}, capmode_proto={16:0}, capmode_proto_group0={-5:0}, capmode_proto_group1={-6:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldvarg0=257, ldvarg1=0, ldvarg2={18446744073709551618:0}, ldvarg3={-3:0}, ldvarg4=3, ldvarg5=0, ldvarg6=-4, ldvarg7=-2, ref_cnt=0, set_impl={17:0}, tmp=-2, tmp___0={-3:0}, tmp___1=257, tmp___2=0, tmp___3=-4, tmp___4=0, tmp___5=3, tmp___6=0, tmp___7=3, tmp___8=1] [L5714] COND TRUE ldv_state_variable_1 == 1 [L5715] CALL rx(capmode_proto_group1, ldvarg1, capmode_proto_group0, ldvarg0) [L5408] struct arcnet_local *lp ; [L5409] void *tmp ; [L5410] struct sk_buff *skb ; [L5411] struct archdr *pkt ; [L5412] char *pktbuf ; [L5413] char *pkthdrbuf ; [L5414] int ofs ; [L5415] unsigned char *tmp___0 ; [L5416] size_t __len ; [L5417] void *__ret ; [L5418] size_t __len___0 ; [L5419] void *__ret___0 ; VAL [\old(bufnum)=0, \old(length)=257, arc_bcast_proto={16:0}, arc_proto_default={16:0}, arc_proto_map={18446744073709551624:10}, arc_raw_proto={16:0}, bufnum=0, capmode_proto={16:0}, capmode_proto_group0={-5:0}, capmode_proto_group1={-6:0}, dev={-6:0}, dev={-6:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, length=257, pkthdr={-5:0}, pkthdr={-5:0}, ref_cnt=0, set_impl={17:0}] [L5421] CALL, EXPR netdev_priv((struct net_device const *)dev) VAL [arc_bcast_proto={16:0}, arc_proto_default={16:0}, arc_proto_map={18446744073709551624:10}, arc_raw_proto={16:0}, capmode_proto={16:0}, capmode_proto_group0={-5:0}, capmode_proto_group1={-6:0}, dev={-6:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, set_impl={17:0}] [L5387] return ((void *)dev + 3264U); VAL [\result={-6:3264}, arc_bcast_proto={16:0}, arc_proto_default={16:0}, arc_proto_map={18446744073709551624:10}, arc_raw_proto={16:0}, capmode_proto={16:0}, capmode_proto_group0={-5:0}, capmode_proto_group1={-6:0}, dev={-6:0}, dev={-6:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, set_impl={17:0}] [L5421] RET, EXPR netdev_priv((struct net_device const *)dev) VAL [\old(bufnum)=0, \old(length)=257, arc_bcast_proto={16:0}, arc_proto_default={16:0}, arc_proto_map={18446744073709551624:10}, arc_raw_proto={16:0}, bufnum=0, capmode_proto={16:0}, capmode_proto_group0={-5:0}, capmode_proto_group1={-6:0}, dev={-6:0}, dev={-6:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, length=257, netdev_priv((struct net_device const *)dev)={-6:3264}, pkthdr={-5:0}, pkthdr={-5:0}, ref_cnt=0, set_impl={17:0}] [L5421] tmp = netdev_priv((struct net_device const *)dev) [L5422] lp = (struct arcnet_local *)tmp [L5423] pkt = pkthdr VAL [\old(bufnum)=0, \old(length)=257, arc_bcast_proto={16:0}, arc_proto_default={16:0}, arc_proto_map={18446744073709551624:10}, arc_raw_proto={16:0}, bufnum=0, capmode_proto={16:0}, capmode_proto_group0={-5:0}, capmode_proto_group1={-6:0}, dev={-6:0}, dev={-6:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, length=257, lp={-6:3264}, pkt={-5:0}, pkthdr={-5:0}, pkthdr={-5:0}, ref_cnt=0, set_impl={17:0}, tmp={-6:3264}] [L5424] COND TRUE length > 256 [L5425] ofs = 512 - length VAL [\old(bufnum)=0, \old(length)=257, arc_bcast_proto={16:0}, arc_proto_default={16:0}, arc_proto_map={18446744073709551624:10}, arc_raw_proto={16:0}, bufnum=0, capmode_proto={16:0}, capmode_proto_group0={-5:0}, capmode_proto_group1={-6:0}, dev={-6:0}, dev={-6:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, length=257, lp={-6:3264}, ofs=255, pkt={-5:0}, pkthdr={-5:0}, pkthdr={-5:0}, ref_cnt=0, set_impl={17:0}, tmp={-6:3264}] [L5429] CALL, EXPR ldv_alloc_skb_14((unsigned int )length + 8U, 32U) VAL [\old(last_index)=0, \old(priority)=32, \old(size)=265, arc_bcast_proto={16:0}, arc_proto_default={16:0}, arc_proto_map={18446744073709551624:10}, arc_raw_proto={16:0}, capmode_proto={16:0}, capmode_proto_group0={-5:0}, capmode_proto_group1={-6:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, set_impl={17:0}] [L5817] struct sk_buff *tmp ; VAL [\old(last_index)=0, \old(priority)=32, \old(size)=265, arc_bcast_proto={16:0}, arc_proto_default={16:0}, arc_proto_map={18446744073709551624:10}, arc_raw_proto={16:0}, capmode_proto={16:0}, capmode_proto_group0={-5:0}, capmode_proto_group1={-6:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, priority=32, ref_cnt=0, set_impl={17:0}, size=265] [L5819] CALL, EXPR ldv_skb_alloc() VAL [\old(last_index)=0, arc_bcast_proto={16:0}, arc_proto_default={16:0}, arc_proto_map={18446744073709551624:10}, arc_raw_proto={16:0}, capmode_proto={16:0}, capmode_proto_group0={-5:0}, capmode_proto_group1={-6:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, set_impl={17:0}] [L5983] void *skb ; [L5984] void *tmp___7 ; VAL [\old(last_index)=0, arc_bcast_proto={16:0}, arc_proto_default={16:0}, arc_proto_map={18446744073709551624:10}, arc_raw_proto={16:0}, capmode_proto={16:0}, capmode_proto_group0={-5:0}, capmode_proto_group1={-6:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, set_impl={17:0}] [L5986] CALL, EXPR ldv_successful_zalloc(sizeof(struct sk_buff___0 )) VAL [\old(__size)=248, \old(last_index)=0, arc_bcast_proto={16:0}, arc_proto_default={16:0}, arc_proto_map={18446744073709551624:10}, arc_raw_proto={16:0}, capmode_proto={16:0}, capmode_proto_group0={-5:0}, capmode_proto_group1={-6:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, set_impl={17:0}] [L5296] EXPR, FCALL calloc(1UL, __size) VAL [\old(__size)=248, \old(last_index)=0, __size=248, arc_bcast_proto={16:0}, arc_proto_default={16:0}, arc_proto_map={18446744073709551624:10}, arc_raw_proto={16:0}, calloc(1UL, __size)={18446744073709551616:0}, capmode_proto={16:0}, capmode_proto_group0={-5:0}, capmode_proto_group1={-6:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, set_impl={17:0}] [L5296] void *p = calloc(1UL, __size); VAL [\old(__size)=248, \old(last_index)=0, __size=248, arc_bcast_proto={16:0}, arc_proto_default={16:0}, arc_proto_map={18446744073709551624:10}, arc_raw_proto={16:0}, calloc(1UL, __size)={18446744073709551616:0}, capmode_proto={16:0}, capmode_proto_group0={-5:0}, capmode_proto_group1={-6:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, p={18446744073709551616:0}, ref_cnt=0, set_impl={17:0}] [L5297] CALL assume_abort_if_not(p != (void *)0) VAL [\old(cond)=1, \old(last_index)=0, arc_bcast_proto={16:0}, arc_proto_default={16:0}, arc_proto_map={18446744073709551624:10}, arc_raw_proto={16:0}, capmode_proto={16:0}, capmode_proto_group0={-5:0}, capmode_proto_group1={-6:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, set_impl={17:0}] [L5293] COND FALSE !(!cond) VAL [\old(cond)=1, \old(last_index)=0, arc_bcast_proto={16:0}, arc_proto_default={16:0}, arc_proto_map={18446744073709551624:10}, arc_raw_proto={16:0}, capmode_proto={16:0}, capmode_proto_group0={-5:0}, capmode_proto_group1={-6:0}, cond=1, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, set_impl={17:0}] [L5297] RET assume_abort_if_not(p != (void *)0) VAL [\old(__size)=248, \old(last_index)=0, __size=248, arc_bcast_proto={16:0}, arc_proto_default={16:0}, arc_proto_map={18446744073709551624:10}, arc_raw_proto={16:0}, calloc(1UL, __size)={18446744073709551616:0}, capmode_proto={16:0}, capmode_proto_group0={-5:0}, capmode_proto_group1={-6:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, p={18446744073709551616:0}, ref_cnt=0, set_impl={17:0}] [L5298] return p; VAL [\old(__size)=248, \old(last_index)=0, \result={18446744073709551616:0}, __size=248, arc_bcast_proto={16:0}, arc_proto_default={16:0}, arc_proto_map={18446744073709551624:10}, arc_raw_proto={16:0}, calloc(1UL, __size)={18446744073709551616:0}, capmode_proto={16:0}, capmode_proto_group0={-5:0}, capmode_proto_group1={-6:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, p={18446744073709551616:0}, ref_cnt=0, set_impl={17:0}] [L5986] RET, EXPR ldv_successful_zalloc(sizeof(struct sk_buff___0 )) VAL [\old(last_index)=0, arc_bcast_proto={16:0}, arc_proto_default={16:0}, arc_proto_map={18446744073709551624:10}, arc_raw_proto={16:0}, capmode_proto={16:0}, capmode_proto_group0={-5:0}, capmode_proto_group1={-6:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_successful_zalloc(sizeof(struct sk_buff___0 ))={18446744073709551616:0}, ref_cnt=0, set_impl={17:0}] [L5986] tmp___7 = ldv_successful_zalloc(sizeof(struct sk_buff___0 )) [L5987] skb = (struct sk_buff___0 *)tmp___7 VAL [\old(last_index)=0, arc_bcast_proto={16:0}, arc_proto_default={16:0}, arc_proto_map={18446744073709551624:10}, arc_raw_proto={16:0}, capmode_proto={16:0}, capmode_proto_group0={-5:0}, capmode_proto_group1={-6:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, set_impl={17:0}, skb={18446744073709551616:0}, tmp___7={18446744073709551616:0}] [L5988] COND FALSE !(! skb) [L5991] CALL ldv_set_add(LDV_SKBS, skb) [L5859] int i ; [L5861] i = 0 VAL [\old(last_index)=0, arc_bcast_proto={16:0}, arc_proto_default={16:0}, arc_proto_map={18446744073709551624:10}, arc_raw_proto={16:0}, capmode_proto={16:0}, capmode_proto_group0={-5:0}, capmode_proto_group1={-6:0}, e={18446744073709551616:0}, e={18446744073709551616:0}, i=0, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, set={0:0}, set={0:0}, set_impl={17:0}] [L5862] COND TRUE 1 VAL [\old(last_index)=0, arc_bcast_proto={16:0}, arc_proto_default={16:0}, arc_proto_map={18446744073709551624:10}, arc_raw_proto={16:0}, capmode_proto={16:0}, capmode_proto_group0={-5:0}, capmode_proto_group1={-6:0}, e={18446744073709551616:0}, e={18446744073709551616:0}, i=0, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, set={0:0}, set={0:0}, set_impl={17:0}] [L5863] COND FALSE !(i < last_index) VAL [\old(last_index)=0, arc_bcast_proto={16:0}, arc_proto_default={16:0}, arc_proto_map={18446744073709551624:10}, arc_raw_proto={16:0}, capmode_proto={16:0}, capmode_proto_group0={-5:0}, capmode_proto_group1={-6:0}, e={18446744073709551616:0}, e={18446744073709551616:0}, i=0, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, set={0:0}, set={0:0}, set_impl={17:0}] [L5873] COND TRUE last_index < 15 [L5874] set_impl[last_index] = e [L5875] last_index = last_index + 1 VAL [\old(last_index)=0, arc_bcast_proto={16:0}, arc_proto_default={16:0}, arc_proto_map={18446744073709551624:10}, arc_raw_proto={16:0}, capmode_proto={16:0}, capmode_proto_group0={-5:0}, capmode_proto_group1={-6:0}, e={18446744073709551616:0}, e={18446744073709551616:0}, i=0, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, set={0:0}, set={0:0}, set_impl={17:0}] [L5991] RET ldv_set_add(LDV_SKBS, skb) [L5992] return (skb); VAL [\old(last_index)=0, \result={18446744073709551616:0}, arc_bcast_proto={16:0}, arc_proto_default={16:0}, arc_proto_map={18446744073709551624:10}, arc_raw_proto={16:0}, capmode_proto={16:0}, capmode_proto_group0={-5:0}, capmode_proto_group1={-6:0}, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, set_impl={17:0}, skb={18446744073709551616:0}, tmp___7={18446744073709551616:0}] [L5819] RET, EXPR ldv_skb_alloc() VAL [\old(last_index)=0, \old(priority)=32, \old(size)=265, arc_bcast_proto={16:0}, arc_proto_default={16:0}, arc_proto_map={18446744073709551624:10}, arc_raw_proto={16:0}, capmode_proto={16:0}, capmode_proto_group0={-5:0}, capmode_proto_group1={-6:0}, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_skb_alloc()={18446744073709551616:0}, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, priority=32, ref_cnt=0, set_impl={17:0}, size=265] [L5819] tmp = ldv_skb_alloc() [L5820] COND TRUE \read(*tmp) VAL [\old(last_index)=0, \old(priority)=32, \old(size)=265, arc_bcast_proto={16:0}, arc_proto_default={16:0}, arc_proto_map={18446744073709551624:10}, arc_raw_proto={16:0}, capmode_proto={16:0}, capmode_proto_group0={-5:0}, capmode_proto_group1={-6:0}, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, priority=32, ref_cnt=0, set_impl={17:0}, size=265, tmp={18446744073709551616:0}] [L5822] CALL, EXPR ldv_malloc(size) VAL [\old(last_index)=0, \old(size)=265, arc_bcast_proto={16:0}, arc_proto_default={16:0}, arc_proto_map={18446744073709551624:10}, arc_raw_proto={16:0}, capmode_proto={16:0}, capmode_proto_group0={-5:0}, capmode_proto_group1={-6:0}, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, set_impl={17:0}] [L5302] void *p ; [L5303] void *tmp ; [L5304] int tmp___0 ; [L5306] tmp___0 = __VERIFIER_nondet_int() [L5307] COND TRUE tmp___0 != 0 [L5308] return ((void *)0); VAL [\old(last_index)=0, \old(size)=265, \result={0:0}, arc_bcast_proto={16:0}, arc_proto_default={16:0}, arc_proto_map={18446744073709551624:10}, arc_raw_proto={16:0}, capmode_proto={16:0}, capmode_proto_group0={-5:0}, capmode_proto_group1={-6:0}, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, set_impl={17:0}, size=265, tmp___0=-7] [L5822] RET, EXPR ldv_malloc(size) VAL [\old(last_index)=0, \old(priority)=32, \old(size)=265, arc_bcast_proto={16:0}, arc_proto_default={16:0}, arc_proto_map={18446744073709551624:10}, arc_raw_proto={16:0}, capmode_proto={16:0}, capmode_proto_group0={-5:0}, capmode_proto_group1={-6:0}, last_index=1, LDV_IN_INTERRUPT=1, ldv_malloc(size)={0:0}, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, priority=32, ref_cnt=0, set_impl={17:0}, size=265, tmp={18446744073709551616:0}] [L5822] tmp->head = ldv_malloc(size) [L5823] EXPR tmp->head [L5823] tmp->data = tmp->head [L5825] return (tmp); VAL [\old(last_index)=0, \old(priority)=32, \old(size)=265, \result={18446744073709551616:0}, arc_bcast_proto={16:0}, arc_proto_default={16:0}, arc_proto_map={18446744073709551624:10}, arc_raw_proto={16:0}, capmode_proto={16:0}, capmode_proto_group0={-5:0}, capmode_proto_group1={-6:0}, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, priority=32, ref_cnt=0, set_impl={17:0}, size=265, tmp={18446744073709551616:0}] [L5429] RET, EXPR ldv_alloc_skb_14((unsigned int )length + 8U, 32U) VAL [\old(bufnum)=0, \old(length)=257, arc_bcast_proto={16:0}, arc_proto_default={16:0}, arc_proto_map={18446744073709551624:10}, arc_raw_proto={16:0}, bufnum=0, capmode_proto={16:0}, capmode_proto_group0={-5:0}, capmode_proto_group1={-6:0}, dev={-6:0}, dev={-6:0}, last_index=1, ldv_alloc_skb_14((unsigned int )length + 8U, 32U)={18446744073709551616:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, length=257, lp={-6:3264}, ofs=255, pkt={-5:0}, pkthdr={-5:0}, pkthdr={-5:0}, ref_cnt=0, set_impl={17:0}, tmp={-6:3264}] [L5429] skb = ldv_alloc_skb_14((unsigned int )length + 8U, 32U) [L5430] COND TRUE (unsigned long )skb == (unsigned long )((struct sk_buff *)0) VAL [\old(bufnum)=0, \old(length)=257, arc_bcast_proto={16:0}, arc_proto_default={16:0}, arc_proto_map={18446744073709551624:10}, arc_raw_proto={16:0}, bufnum=0, capmode_proto={16:0}, capmode_proto_group0={-5:0}, capmode_proto_group1={-6:0}, dev={-6:0}, dev={-6:0}, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, length=257, lp={-6:3264}, ofs=255, pkt={-5:0}, pkthdr={-5:0}, pkthdr={-5:0}, ref_cnt=0, set_impl={17:0}, skb={18446744073709551616:0}, tmp={-6:3264}] [L5431] COND FALSE !(arcnet_debug & 1) VAL [\old(bufnum)=0, \old(length)=257, arc_bcast_proto={16:0}, arc_proto_default={16:0}, arc_proto_map={18446744073709551624:10}, arc_raw_proto={16:0}, bufnum=0, capmode_proto={16:0}, capmode_proto_group0={-5:0}, capmode_proto_group1={-6:0}, dev={-6:0}, dev={-6:0}, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, length=257, lp={-6:3264}, ofs=255, pkt={-5:0}, pkthdr={-5:0}, pkthdr={-5:0}, ref_cnt=0, set_impl={17:0}, skb={18446744073709551616:0}, tmp={-6:3264}] [L5435] EXPR dev->stats.rx_dropped [L5435] dev->stats.rx_dropped = dev->stats.rx_dropped + 1UL [L5715] RET rx(capmode_proto_group1, ldvarg1, capmode_proto_group0, ldvarg0) [L5716] ldv_state_variable_1 = 1 VAL [arc_bcast_proto={16:0}, arc_proto_default={16:0}, arc_proto_map={18446744073709551624:10}, arc_raw_proto={16:0}, capmode_proto={16:0}, capmode_proto_group0={-5:0}, capmode_proto_group1={-6:0}, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldvarg0=257, ldvarg1=0, ldvarg2={18446744073709551618:0}, ldvarg3={-3:0}, ldvarg4=3, ldvarg5=0, ldvarg6=-4, ldvarg7=-2, ref_cnt=0, set_impl={17:0}, tmp=-2, tmp___0={-3:0}, tmp___1=257, tmp___2=0, tmp___3=-4, tmp___4=0, tmp___5=3, tmp___6=0, tmp___7=3, tmp___8=1] [L5686] tmp___6 = __VERIFIER_nondet_int() [L5688] case 0: [L5727] case 1: VAL [arc_bcast_proto={16:0}, arc_proto_default={16:0}, arc_proto_map={18446744073709551624:10}, arc_raw_proto={16:0}, capmode_proto={16:0}, capmode_proto_group0={-5:0}, capmode_proto_group1={-6:0}, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldvarg0=257, ldvarg1=0, ldvarg2={18446744073709551618:0}, ldvarg3={-3:0}, ldvarg4=3, ldvarg5=0, ldvarg6=-4, ldvarg7=-2, ref_cnt=0, set_impl={17:0}, tmp=-2, tmp___0={-3:0}, tmp___1=257, tmp___2=0, tmp___3=-4, tmp___4=0, tmp___5=3, tmp___6=1, tmp___7=3, tmp___8=1] [L5728] COND TRUE ldv_state_variable_0 != 0 [L5729] tmp___8 = __VERIFIER_nondet_int() [L5731] case 0: VAL [arc_bcast_proto={16:0}, arc_proto_default={16:0}, arc_proto_map={18446744073709551624:10}, arc_raw_proto={16:0}, capmode_proto={16:0}, capmode_proto_group0={-5:0}, capmode_proto_group1={-6:0}, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldvarg0=257, ldvarg1=0, ldvarg2={18446744073709551618:0}, ldvarg3={-3:0}, ldvarg4=3, ldvarg5=0, ldvarg6=-4, ldvarg7=-2, ref_cnt=0, set_impl={17:0}, tmp=-2, tmp___0={-3:0}, tmp___1=257, tmp___2=0, tmp___3=-4, tmp___4=0, tmp___5=3, tmp___6=1, tmp___7=3, tmp___8=0] [L5732] COND TRUE ldv_state_variable_0 == 3 && ref_cnt == 0 [L5733] CALL capmode_module_exit() [L5626] FCALL arcnet_unregister_proto(& capmode_proto) [L5733] RET capmode_module_exit() [L5734] ldv_state_variable_0 = 2 VAL [arc_bcast_proto={16:0}, arc_proto_default={16:0}, arc_proto_map={18446744073709551624:10}, arc_raw_proto={16:0}, capmode_proto={16:0}, capmode_proto_group0={-5:0}, capmode_proto_group1={-6:0}, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=2, ldv_state_variable_1=1, ldvarg0=257, ldvarg1=0, ldvarg2={18446744073709551618:0}, ldvarg3={-3:0}, ldvarg4=3, ldvarg5=0, ldvarg6=-4, ldvarg7=-2, ref_cnt=0, set_impl={17:0}, tmp=-2, tmp___0={-3:0}, tmp___1=257, tmp___2=0, tmp___3=-4, tmp___4=0, tmp___5=3, tmp___6=1, tmp___7=3, tmp___8=0] [L5769] CALL ldv_check_final_state() [L6050] int tmp___7 ; [L6052] CALL, EXPR ldv_set_is_empty(LDV_SKBS) [L5941] return (last_index == 0); VAL [\result=0, arc_bcast_proto={16:0}, arc_proto_default={16:0}, arc_proto_map={18446744073709551624:10}, arc_raw_proto={16:0}, capmode_proto={16:0}, capmode_proto_group0={-5:0}, capmode_proto_group1={-6:0}, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=2, ldv_state_variable_1=1, ref_cnt=0, set={0:0}, set={0:0}, set_impl={17:0}] [L6052] RET, EXPR ldv_set_is_empty(LDV_SKBS) [L6052] tmp___7 = ldv_set_is_empty(LDV_SKBS) [L6053] COND FALSE !(\read(tmp___7)) VAL [arc_bcast_proto={16:0}, arc_proto_default={16:0}, arc_proto_map={18446744073709551624:10}, arc_raw_proto={16:0}, capmode_proto={16:0}, capmode_proto_group0={-5:0}, capmode_proto_group1={-6:0}, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=2, ldv_state_variable_1=1, ref_cnt=0, set_impl={17:0}, tmp___7=0] [L6055] CALL ldv_error() VAL [arc_bcast_proto={16:0}, arc_proto_default={16:0}, arc_proto_map={18446744073709551624:10}, arc_raw_proto={16:0}, capmode_proto={16:0}, capmode_proto_group0={-5:0}, capmode_proto_group1={-6:0}, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=2, ldv_state_variable_1=1, ref_cnt=0, set_impl={17:0}] [L5354] reach_error() VAL [arc_bcast_proto={16:0}, arc_proto_default={16:0}, arc_proto_map={18446744073709551624:10}, arc_raw_proto={16:0}, capmode_proto={16:0}, capmode_proto_group0={-5:0}, capmode_proto_group1={-6:0}, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=2, ldv_state_variable_1=1, ref_cnt=0, set_impl={17:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 17 procedures, 228 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.3s, OverallIterations: 10, TraceHistogramMax: 8, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1739 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1657 mSDsluCounter, 9859 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7203 mSDsCounter, 842 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2422 IncrementalHoareTripleChecker+Invalid, 3264 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 842 mSolverCounterUnsat, 2656 mSDtfsCounter, 2422 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 601 GetRequests, 535 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=851occurred in iteration=9, InterpolantAutomatonStates: 74, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 322 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 1158 NumberOfCodeBlocks, 1158 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 1173 ConstructedInterpolants, 0 QuantifiedInterpolants, 1887 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1337 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 13 InterpolantComputations, 7 PerfectInterpolantSequences, 716/803 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-12-18 03:59:58,261 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_safes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--arcnet--capmode.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 992626749f2e8ca84a93ad6fc64a197d6c8e66b412d995c24cf1e1136a1f2393 --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-18 03:59:59,883 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-18 03:59:59,884 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-18 03:59:59,910 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-18 03:59:59,911 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-18 03:59:59,912 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-18 03:59:59,912 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-18 03:59:59,913 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-18 03:59:59,925 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-18 03:59:59,926 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-18 03:59:59,926 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-18 03:59:59,927 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-18 03:59:59,927 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-18 03:59:59,928 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-18 03:59:59,929 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-18 03:59:59,930 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-18 03:59:59,930 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-18 03:59:59,931 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-18 03:59:59,932 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-18 03:59:59,933 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-18 03:59:59,934 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-18 03:59:59,935 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-18 03:59:59,935 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-18 03:59:59,936 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-18 03:59:59,938 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-18 03:59:59,938 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-18 03:59:59,938 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-18 03:59:59,938 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-18 03:59:59,939 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-18 03:59:59,939 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-18 03:59:59,940 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-18 03:59:59,940 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-18 03:59:59,941 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-18 03:59:59,941 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-18 03:59:59,942 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-18 03:59:59,942 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-18 03:59:59,942 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-18 03:59:59,943 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-18 03:59:59,943 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-18 03:59:59,943 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-18 03:59:59,944 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-18 03:59:59,948 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2021-12-18 03:59:59,980 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-18 03:59:59,980 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-18 03:59:59,981 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-18 03:59:59,981 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-18 03:59:59,982 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-18 03:59:59,982 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-18 03:59:59,982 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-18 03:59:59,983 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-18 03:59:59,983 INFO L138 SettingsManager]: * Use SBE=true [2021-12-18 03:59:59,983 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-18 03:59:59,984 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-18 03:59:59,984 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-18 03:59:59,984 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-18 03:59:59,984 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-18 03:59:59,984 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-18 03:59:59,984 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-12-18 03:59:59,984 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-12-18 03:59:59,984 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-18 03:59:59,984 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-18 03:59:59,994 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-18 03:59:59,994 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-18 03:59:59,994 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-18 03:59:59,994 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-18 03:59:59,994 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-18 03:59:59,994 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-18 03:59:59,994 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-18 03:59:59,994 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-18 03:59:59,994 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-12-18 03:59:59,995 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-12-18 03:59:59,995 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-18 03:59:59,995 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-18 03:59:59,995 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-18 03:59:59,995 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-18 03:59:59,995 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-12-18 03:59:59,995 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 -> 992626749f2e8ca84a93ad6fc64a197d6c8e66b412d995c24cf1e1136a1f2393 [2021-12-18 04:00:00,258 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-18 04:00:00,281 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-18 04:00:00,282 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-18 04:00:00,283 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-18 04:00:00,284 INFO L275 PluginConnector]: CDTParser initialized [2021-12-18 04:00:00,285 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_safes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--arcnet--capmode.ko-entry_point.cil.out.i [2021-12-18 04:00:00,344 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19a4dfbc5/8e2201dc5b4946a2a63d7e6752298ea6/FLAG98c0baf8e [2021-12-18 04:00:00,833 INFO L306 CDTParser]: Found 1 translation units. [2021-12-18 04:00:00,834 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_safes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--arcnet--capmode.ko-entry_point.cil.out.i [2021-12-18 04:00:00,857 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19a4dfbc5/8e2201dc5b4946a2a63d7e6752298ea6/FLAG98c0baf8e [2021-12-18 04:00:01,086 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19a4dfbc5/8e2201dc5b4946a2a63d7e6752298ea6 [2021-12-18 04:00:01,088 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-18 04:00:01,089 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-18 04:00:01,090 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-18 04:00:01,090 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-18 04:00:01,093 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-18 04:00:01,093 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 04:00:01" (1/1) ... [2021-12-18 04:00:01,094 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20ba4e37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:00:01, skipping insertion in model container [2021-12-18 04:00:01,094 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 04:00:01" (1/1) ... [2021-12-18 04:00:01,099 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-18 04:00:01,170 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-18 04:00:01,640 WARN L230 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_safes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--arcnet--capmode.ko-entry_point.cil.out.i[154031,154044] [2021-12-18 04:00:01,819 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-18 04:00:01,837 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2021-12-18 04:00:01,871 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-18 04:00:01,932 WARN L230 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_safes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--arcnet--capmode.ko-entry_point.cil.out.i[154031,154044] [2021-12-18 04:00:01,989 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-18 04:00:01,997 INFO L203 MainTranslator]: Completed pre-run [2021-12-18 04:00:02,074 WARN L230 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_safes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--arcnet--capmode.ko-entry_point.cil.out.i[154031,154044] [2021-12-18 04:00:02,112 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-18 04:00:02,136 INFO L208 MainTranslator]: Completed translation [2021-12-18 04:00:02,136 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:00:02 WrapperNode [2021-12-18 04:00:02,137 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-18 04:00:02,137 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-18 04:00:02,137 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-18 04:00:02,138 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-18 04:00:02,142 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:00:02" (1/1) ... [2021-12-18 04:00:02,174 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:00:02" (1/1) ... [2021-12-18 04:00:02,201 INFO L137 Inliner]: procedures = 103, calls = 193, calls flagged for inlining = 27, calls inlined = 24, statements flattened = 529 [2021-12-18 04:00:02,201 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-18 04:00:02,202 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-18 04:00:02,202 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-18 04:00:02,202 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-18 04:00:02,208 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:00:02" (1/1) ... [2021-12-18 04:00:02,208 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:00:02" (1/1) ... [2021-12-18 04:00:02,226 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:00:02" (1/1) ... [2021-12-18 04:00:02,227 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:00:02" (1/1) ... [2021-12-18 04:00:02,264 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:00:02" (1/1) ... [2021-12-18 04:00:02,274 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:00:02" (1/1) ... [2021-12-18 04:00:02,281 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:00:02" (1/1) ... [2021-12-18 04:00:02,296 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-18 04:00:02,303 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-18 04:00:02,303 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-18 04:00:02,303 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-18 04:00:02,304 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:00:02" (1/1) ... [2021-12-18 04:00:02,309 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-18 04:00:02,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 04:00:02,368 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-12-18 04:00:02,415 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-12-18 04:00:02,475 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2021-12-18 04:00:02,475 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2021-12-18 04:00:02,475 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-12-18 04:00:02,478 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2021-12-18 04:00:02,478 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2 [2021-12-18 04:00:02,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2021-12-18 04:00:02,478 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2021-12-18 04:00:02,479 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2021-12-18 04:00:02,479 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2021-12-18 04:00:02,479 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2021-12-18 04:00:02,479 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2021-12-18 04:00:02,479 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2021-12-18 04:00:02,479 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2021-12-18 04:00:02,479 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2021-12-18 04:00:02,479 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_alloc_skb_14 [2021-12-18 04:00:02,480 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_alloc_skb_14 [2021-12-18 04:00:02,480 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~C_INT~X~C_INT~X~$Pointer$~X~C_INT~TO~VOID [2021-12-18 04:00:02,480 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~C_INT~X~C_INT~X~$Pointer$~X~C_INT~TO~VOID [2021-12-18 04:00:02,480 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_alloc [2021-12-18 04:00:02,480 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_alloc [2021-12-18 04:00:02,480 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2021-12-18 04:00:02,480 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2021-12-18 04:00:02,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2021-12-18 04:00:02,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2 [2021-12-18 04:00:02,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1 [2021-12-18 04:00:02,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE8 [2021-12-18 04:00:02,481 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-12-18 04:00:02,481 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-12-18 04:00:02,481 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-18 04:00:02,481 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_free_int [2021-12-18 04:00:02,482 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_free_int [2021-12-18 04:00:02,482 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-18 04:00:02,482 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-18 04:00:02,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-18 04:00:02,482 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE8 [2021-12-18 04:00:02,482 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE2 [2021-12-18 04:00:02,483 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE4 [2021-12-18 04:00:02,483 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-18 04:00:02,483 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_set_remove [2021-12-18 04:00:02,483 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_set_remove [2021-12-18 04:00:02,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2021-12-18 04:00:02,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2021-12-18 04:00:02,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2 [2021-12-18 04:00:02,483 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-18 04:00:02,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-12-18 04:00:02,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-12-18 04:00:02,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-12-18 04:00:02,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2021-12-18 04:00:02,484 INFO L130 BoogieDeclarations]: Found specification of procedure skb_put [2021-12-18 04:00:02,485 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_put [2021-12-18 04:00:02,487 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_successful_zalloc [2021-12-18 04:00:02,487 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_successful_zalloc [2021-12-18 04:00:02,488 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2021-12-18 04:00:02,489 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2021-12-18 04:00:02,489 INFO L130 BoogieDeclarations]: Found specification of procedure skb_mac_header [2021-12-18 04:00:02,489 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_mac_header [2021-12-18 04:00:02,489 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE1 [2021-12-18 04:00:02,489 INFO L130 BoogieDeclarations]: Found specification of procedure skb_reset_mac_header [2021-12-18 04:00:02,489 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_reset_mac_header [2021-12-18 04:00:02,490 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-18 04:00:02,490 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-18 04:00:02,715 INFO L236 CfgBuilder]: Building ICFG [2021-12-18 04:00:02,720 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-18 04:00:02,902 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2021-12-18 04:00:05,693 INFO L277 CfgBuilder]: Performing block encoding [2021-12-18 04:00:05,699 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-18 04:00:05,699 INFO L301 CfgBuilder]: Removed 3 assume(true) statements. [2021-12-18 04:00:05,700 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 04:00:05 BoogieIcfgContainer [2021-12-18 04:00:05,700 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-18 04:00:05,701 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-18 04:00:05,701 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-18 04:00:05,703 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-18 04:00:05,703 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 04:00:01" (1/3) ... [2021-12-18 04:00:05,704 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26a3aaf4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 04:00:05, skipping insertion in model container [2021-12-18 04:00:05,704 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:00:02" (2/3) ... [2021-12-18 04:00:05,704 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26a3aaf4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 04:00:05, skipping insertion in model container [2021-12-18 04:00:05,704 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 04:00:05" (3/3) ... [2021-12-18 04:00:05,705 INFO L111 eAbstractionObserver]: Analyzing ICFG 205_9a_array_safes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--arcnet--capmode.ko-entry_point.cil.out.i [2021-12-18 04:00:05,708 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-18 04:00:05,708 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-18 04:00:05,742 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-18 04:00:05,747 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-12-18 04:00:05,747 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-18 04:00:05,761 INFO L276 IsEmpty]: Start isEmpty. Operand has 227 states, 170 states have (on average 1.3647058823529412) internal successors, (232), 175 states have internal predecessors, (232), 40 states have call successors, (40), 16 states have call predecessors, (40), 15 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2021-12-18 04:00:05,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-18 04:00:05,767 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 04:00:05,767 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, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 04:00:05,767 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 04:00:05,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 04:00:05,771 INFO L85 PathProgramCache]: Analyzing trace with hash -1585805392, now seen corresponding path program 1 times [2021-12-18 04:00:05,782 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 04:00:05,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1253487814] [2021-12-18 04:00:05,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 04:00:05,784 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 04:00:05,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 04:00:05,797 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-12-18 04:00:05,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-12-18 04:00:06,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 04:00:06,032 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 1 conjunts are in the unsatisfiable core [2021-12-18 04:00:06,036 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 04:00:06,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 04:00:06,134 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 04:00:06,134 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 04:00:06,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1253487814] [2021-12-18 04:00:06,148 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1253487814] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 04:00:06,148 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 04:00:06,148 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-18 04:00:06,149 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785450958] [2021-12-18 04:00:06,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 04:00:06,152 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-18 04:00:06,152 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 04:00:06,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-18 04:00:06,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-18 04:00:06,192 INFO L87 Difference]: Start difference. First operand has 227 states, 170 states have (on average 1.3647058823529412) internal successors, (232), 175 states have internal predecessors, (232), 40 states have call successors, (40), 16 states have call predecessors, (40), 15 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-12-18 04:00:06,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 04:00:06,253 INFO L93 Difference]: Finished difference Result 449 states and 630 transitions. [2021-12-18 04:00:06,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-18 04:00:06,255 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 35 [2021-12-18 04:00:06,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 04:00:06,267 INFO L225 Difference]: With dead ends: 449 [2021-12-18 04:00:06,267 INFO L226 Difference]: Without dead ends: 217 [2021-12-18 04:00:06,279 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-18 04:00:06,282 INFO L933 BasicCegarLoop]: 299 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 04:00:06,285 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 04:00:06,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2021-12-18 04:00:06,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2021-12-18 04:00:06,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 165 states have (on average 1.303030303030303) internal successors, (215), 165 states have internal predecessors, (215), 37 states have call successors, (37), 15 states have call predecessors, (37), 14 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2021-12-18 04:00:06,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 288 transitions. [2021-12-18 04:00:06,346 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 288 transitions. Word has length 35 [2021-12-18 04:00:06,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 04:00:06,346 INFO L470 AbstractCegarLoop]: Abstraction has 217 states and 288 transitions. [2021-12-18 04:00:06,347 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-12-18 04:00:06,347 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 288 transitions. [2021-12-18 04:00:06,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-18 04:00:06,349 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 04:00:06,349 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, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 04:00:06,376 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-12-18 04:00:06,561 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-12-18 04:00:06,562 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 04:00:06,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 04:00:06,563 INFO L85 PathProgramCache]: Analyzing trace with hash -1719818898, now seen corresponding path program 1 times [2021-12-18 04:00:06,564 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 04:00:06,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1695302365] [2021-12-18 04:00:06,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 04:00:06,565 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 04:00:06,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 04:00:06,566 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-12-18 04:00:06,570 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-12-18 04:00:06,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 04:00:06,743 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-18 04:00:06,745 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 04:00:06,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 04:00:06,852 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 04:00:06,853 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 04:00:06,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1695302365] [2021-12-18 04:00:06,855 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1695302365] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 04:00:06,855 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 04:00:06,855 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-18 04:00:06,855 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340848750] [2021-12-18 04:00:06,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 04:00:06,856 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-18 04:00:06,857 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 04:00:06,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-18 04:00:06,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 04:00:06,857 INFO L87 Difference]: Start difference. First operand 217 states and 288 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2021-12-18 04:00:06,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 04:00:06,898 INFO L93 Difference]: Finished difference Result 428 states and 569 transitions. [2021-12-18 04:00:06,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-18 04:00:06,899 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 35 [2021-12-18 04:00:06,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 04:00:06,915 INFO L225 Difference]: With dead ends: 428 [2021-12-18 04:00:06,915 INFO L226 Difference]: Without dead ends: 218 [2021-12-18 04:00:06,916 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 04:00:06,917 INFO L933 BasicCegarLoop]: 287 mSDtfsCounter, 0 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 04:00:06,917 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 572 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 04:00:06,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2021-12-18 04:00:06,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2021-12-18 04:00:06,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 166 states have (on average 1.3012048192771084) internal successors, (216), 166 states have internal predecessors, (216), 37 states have call successors, (37), 15 states have call predecessors, (37), 14 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2021-12-18 04:00:06,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 289 transitions. [2021-12-18 04:00:06,942 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 289 transitions. Word has length 35 [2021-12-18 04:00:06,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 04:00:06,943 INFO L470 AbstractCegarLoop]: Abstraction has 218 states and 289 transitions. [2021-12-18 04:00:06,943 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2021-12-18 04:00:06,943 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 289 transitions. [2021-12-18 04:00:06,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-18 04:00:06,944 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 04:00:06,944 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 04:00:06,965 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-12-18 04:00:07,153 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-12-18 04:00:07,154 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 04:00:07,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 04:00:07,154 INFO L85 PathProgramCache]: Analyzing trace with hash 1435931756, now seen corresponding path program 1 times [2021-12-18 04:00:07,155 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 04:00:07,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [968891738] [2021-12-18 04:00:07,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 04:00:07,155 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 04:00:07,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 04:00:07,156 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-12-18 04:00:07,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-12-18 04:00:07,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 04:00:07,404 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-18 04:00:07,405 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 04:00:07,469 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-18 04:00:07,470 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 04:00:07,470 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 04:00:07,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [968891738] [2021-12-18 04:00:07,470 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [968891738] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 04:00:07,470 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 04:00:07,470 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-18 04:00:07,471 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781789406] [2021-12-18 04:00:07,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 04:00:07,471 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-18 04:00:07,471 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 04:00:07,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-18 04:00:07,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 04:00:07,472 INFO L87 Difference]: Start difference. First operand 218 states and 289 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2021-12-18 04:00:07,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 04:00:07,522 INFO L93 Difference]: Finished difference Result 614 states and 818 transitions. [2021-12-18 04:00:07,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-18 04:00:07,523 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 36 [2021-12-18 04:00:07,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 04:00:07,524 INFO L225 Difference]: With dead ends: 614 [2021-12-18 04:00:07,524 INFO L226 Difference]: Without dead ends: 405 [2021-12-18 04:00:07,525 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 04:00:07,526 INFO L933 BasicCegarLoop]: 329 mSDtfsCounter, 254 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 594 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 04:00:07,526 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [254 Valid, 594 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 04:00:07,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2021-12-18 04:00:07,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 405. [2021-12-18 04:00:07,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 306 states have (on average 1.3006535947712419) internal successors, (398), 306 states have internal predecessors, (398), 70 states have call successors, (70), 29 states have call predecessors, (70), 28 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) [2021-12-18 04:00:07,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 537 transitions. [2021-12-18 04:00:07,545 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 537 transitions. Word has length 36 [2021-12-18 04:00:07,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 04:00:07,545 INFO L470 AbstractCegarLoop]: Abstraction has 405 states and 537 transitions. [2021-12-18 04:00:07,545 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2021-12-18 04:00:07,545 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 537 transitions. [2021-12-18 04:00:07,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-12-18 04:00:07,546 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 04:00:07,547 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 04:00:07,557 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-12-18 04:00:07,755 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-12-18 04:00:07,756 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 04:00:07,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 04:00:07,757 INFO L85 PathProgramCache]: Analyzing trace with hash -1862511787, now seen corresponding path program 1 times [2021-12-18 04:00:07,757 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 04:00:07,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1276233212] [2021-12-18 04:00:07,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 04:00:07,758 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 04:00:07,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 04:00:07,771 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-12-18 04:00:07,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-12-18 04:00:07,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 04:00:07,927 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-18 04:00:07,928 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 04:00:08,000 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-18 04:00:08,001 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 04:00:08,001 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 04:00:08,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1276233212] [2021-12-18 04:00:08,001 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1276233212] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 04:00:08,001 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 04:00:08,001 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-18 04:00:08,002 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293163798] [2021-12-18 04:00:08,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 04:00:08,002 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-18 04:00:08,002 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 04:00:08,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-18 04:00:08,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 04:00:08,003 INFO L87 Difference]: Start difference. First operand 405 states and 537 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2021-12-18 04:00:08,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 04:00:08,045 INFO L93 Difference]: Finished difference Result 805 states and 1069 transitions. [2021-12-18 04:00:08,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-18 04:00:08,047 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 42 [2021-12-18 04:00:08,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 04:00:08,049 INFO L225 Difference]: With dead ends: 805 [2021-12-18 04:00:08,049 INFO L226 Difference]: Without dead ends: 409 [2021-12-18 04:00:08,050 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 04:00:08,051 INFO L933 BasicCegarLoop]: 284 mSDtfsCounter, 4 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 566 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 04:00:08,051 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 566 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 04:00:08,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2021-12-18 04:00:08,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 406. [2021-12-18 04:00:08,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 307 states have (on average 1.299674267100977) internal successors, (399), 307 states have internal predecessors, (399), 70 states have call successors, (70), 29 states have call predecessors, (70), 28 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) [2021-12-18 04:00:08,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 538 transitions. [2021-12-18 04:00:08,067 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 538 transitions. Word has length 42 [2021-12-18 04:00:08,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 04:00:08,067 INFO L470 AbstractCegarLoop]: Abstraction has 406 states and 538 transitions. [2021-12-18 04:00:08,068 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2021-12-18 04:00:08,068 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 538 transitions. [2021-12-18 04:00:08,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-12-18 04:00:08,069 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 04:00:08,069 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 04:00:08,080 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-12-18 04:00:08,278 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-12-18 04:00:08,278 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 04:00:08,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 04:00:08,279 INFO L85 PathProgramCache]: Analyzing trace with hash 2065868430, now seen corresponding path program 1 times [2021-12-18 04:00:08,280 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 04:00:08,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [535016801] [2021-12-18 04:00:08,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 04:00:08,280 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 04:00:08,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 04:00:08,281 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-12-18 04:00:08,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-12-18 04:00:08,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 04:00:08,427 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-18 04:00:08,428 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 04:00:08,510 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-18 04:00:08,510 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 04:00:08,606 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-18 04:00:08,606 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 04:00:08,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [535016801] [2021-12-18 04:00:08,606 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [535016801] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 04:00:08,606 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-18 04:00:08,607 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2021-12-18 04:00:08,607 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870382974] [2021-12-18 04:00:08,607 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-18 04:00:08,607 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 04:00:08,607 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 04:00:08,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 04:00:08,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-12-18 04:00:08,608 INFO L87 Difference]: Start difference. First operand 406 states and 538 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2021-12-18 04:00:08,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 04:00:08,697 INFO L93 Difference]: Finished difference Result 815 states and 1083 transitions. [2021-12-18 04:00:08,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-18 04:00:08,697 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 46 [2021-12-18 04:00:08,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 04:00:08,699 INFO L225 Difference]: With dead ends: 815 [2021-12-18 04:00:08,699 INFO L226 Difference]: Without dead ends: 418 [2021-12-18 04:00:08,713 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2021-12-18 04:00:08,713 INFO L933 BasicCegarLoop]: 285 mSDtfsCounter, 24 mSDsluCounter, 565 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 850 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 04:00:08,714 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 850 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 04:00:08,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2021-12-18 04:00:08,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 418. [2021-12-18 04:00:08,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 319 states have (on average 1.297805642633229) internal successors, (414), 319 states have internal predecessors, (414), 70 states have call successors, (70), 29 states have call predecessors, (70), 28 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) [2021-12-18 04:00:08,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 553 transitions. [2021-12-18 04:00:08,724 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 553 transitions. Word has length 46 [2021-12-18 04:00:08,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 04:00:08,725 INFO L470 AbstractCegarLoop]: Abstraction has 418 states and 553 transitions. [2021-12-18 04:00:08,725 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2021-12-18 04:00:08,725 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 553 transitions. [2021-12-18 04:00:08,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-12-18 04:00:08,726 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 04:00:08,726 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 04:00:08,743 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-12-18 04:00:08,935 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-12-18 04:00:08,935 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 04:00:08,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 04:00:08,936 INFO L85 PathProgramCache]: Analyzing trace with hash -2049374919, now seen corresponding path program 2 times [2021-12-18 04:00:08,936 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 04:00:08,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [974718919] [2021-12-18 04:00:08,936 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-18 04:00:08,937 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 04:00:08,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 04:00:08,938 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-12-18 04:00:08,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-12-18 04:00:09,128 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-12-18 04:00:09,128 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-18 04:00:09,133 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-18 04:00:09,135 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 04:00:09,215 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2021-12-18 04:00:09,215 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 04:00:09,215 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 04:00:09,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [974718919] [2021-12-18 04:00:09,216 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [974718919] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 04:00:09,216 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 04:00:09,216 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-18 04:00:09,216 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259813782] [2021-12-18 04:00:09,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 04:00:09,231 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-18 04:00:09,231 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 04:00:09,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-18 04:00:09,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-18 04:00:09,232 INFO L87 Difference]: Start difference. First operand 418 states and 553 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2021-12-18 04:00:09,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 04:00:09,375 INFO L93 Difference]: Finished difference Result 826 states and 1093 transitions. [2021-12-18 04:00:09,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-18 04:00:09,375 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 58 [2021-12-18 04:00:09,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 04:00:09,377 INFO L225 Difference]: With dead ends: 826 [2021-12-18 04:00:09,377 INFO L226 Difference]: Without dead ends: 417 [2021-12-18 04:00:09,378 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-18 04:00:09,379 INFO L933 BasicCegarLoop]: 418 mSDtfsCounter, 430 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 430 SdHoareTripleChecker+Valid, 712 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 04:00:09,379 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [430 Valid, 712 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 04:00:09,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2021-12-18 04:00:09,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 417. [2021-12-18 04:00:09,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 318 states have (on average 1.2893081761006289) internal successors, (410), 318 states have internal predecessors, (410), 70 states have call successors, (70), 29 states have call predecessors, (70), 28 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) [2021-12-18 04:00:09,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 549 transitions. [2021-12-18 04:00:09,391 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 549 transitions. Word has length 58 [2021-12-18 04:00:09,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 04:00:09,392 INFO L470 AbstractCegarLoop]: Abstraction has 417 states and 549 transitions. [2021-12-18 04:00:09,392 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2021-12-18 04:00:09,392 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 549 transitions. [2021-12-18 04:00:09,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-12-18 04:00:09,393 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 04:00:09,394 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 04:00:09,408 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-12-18 04:00:09,599 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-12-18 04:00:09,599 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 04:00:09,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 04:00:09,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1898813064, now seen corresponding path program 1 times [2021-12-18 04:00:09,600 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 04:00:09,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1289098915] [2021-12-18 04:00:09,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 04:00:09,600 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 04:00:09,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 04:00:09,602 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-12-18 04:00:09,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-12-18 04:00:09,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 04:00:09,824 INFO L263 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-18 04:00:09,826 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 04:00:10,020 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 33 proven. 28 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-18 04:00:10,021 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 04:00:10,325 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 5 proven. 28 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2021-12-18 04:00:10,325 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 04:00:10,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1289098915] [2021-12-18 04:00:10,326 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1289098915] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 04:00:10,326 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-18 04:00:10,326 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2021-12-18 04:00:10,326 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102168390] [2021-12-18 04:00:10,326 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-18 04:00:10,327 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-18 04:00:10,327 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 04:00:10,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-18 04:00:10,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2021-12-18 04:00:10,328 INFO L87 Difference]: Start difference. First operand 417 states and 549 transitions. Second operand has 12 states, 12 states have (on average 7.416666666666667) internal successors, (89), 12 states have internal predecessors, (89), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2021-12-18 04:00:10,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 04:00:10,676 INFO L93 Difference]: Finished difference Result 655 states and 865 transitions. [2021-12-18 04:00:10,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-18 04:00:10,677 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.416666666666667) internal successors, (89), 12 states have internal predecessors, (89), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 99 [2021-12-18 04:00:10,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 04:00:10,678 INFO L225 Difference]: With dead ends: 655 [2021-12-18 04:00:10,679 INFO L226 Difference]: Without dead ends: 433 [2021-12-18 04:00:10,679 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2021-12-18 04:00:10,680 INFO L933 BasicCegarLoop]: 286 mSDtfsCounter, 52 mSDsluCounter, 1696 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 1982 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-18 04:00:10,680 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 1982 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-18 04:00:10,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2021-12-18 04:00:10,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 433. [2021-12-18 04:00:10,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 433 states, 334 states have (on average 1.2874251497005988) internal successors, (430), 334 states have internal predecessors, (430), 70 states have call successors, (70), 29 states have call predecessors, (70), 28 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) [2021-12-18 04:00:10,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 569 transitions. [2021-12-18 04:00:10,692 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 569 transitions. Word has length 99 [2021-12-18 04:00:10,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 04:00:10,692 INFO L470 AbstractCegarLoop]: Abstraction has 433 states and 569 transitions. [2021-12-18 04:00:10,692 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.416666666666667) internal successors, (89), 12 states have internal predecessors, (89), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2021-12-18 04:00:10,692 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 569 transitions. [2021-12-18 04:00:10,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2021-12-18 04:00:10,693 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 04:00:10,694 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 04:00:10,704 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-12-18 04:00:10,904 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-12-18 04:00:10,907 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 04:00:10,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 04:00:10,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1274453284, now seen corresponding path program 2 times [2021-12-18 04:00:10,908 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 04:00:10,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1868711743] [2021-12-18 04:00:10,908 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-18 04:00:10,909 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 04:00:10,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 04:00:10,921 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-12-18 04:00:10,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-12-18 04:00:11,202 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-18 04:00:11,202 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-18 04:00:11,217 INFO L263 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-18 04:00:11,220 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 04:00:11,510 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2021-12-18 04:00:11,510 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 04:00:11,510 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 04:00:11,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1868711743] [2021-12-18 04:00:11,510 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1868711743] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 04:00:11,510 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 04:00:11,510 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-18 04:00:11,511 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233767065] [2021-12-18 04:00:11,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 04:00:11,511 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-18 04:00:11,511 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 04:00:11,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-18 04:00:11,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-18 04:00:11,511 INFO L87 Difference]: Start difference. First operand 433 states and 569 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 3 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-18 04:00:11,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 04:00:11,613 INFO L93 Difference]: Finished difference Result 1278 states and 1701 transitions. [2021-12-18 04:00:11,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-18 04:00:11,613 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 3 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 115 [2021-12-18 04:00:11,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 04:00:11,618 INFO L225 Difference]: With dead ends: 1278 [2021-12-18 04:00:11,618 INFO L226 Difference]: Without dead ends: 849 [2021-12-18 04:00:11,619 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-12-18 04:00:11,619 INFO L933 BasicCegarLoop]: 328 mSDtfsCounter, 232 mSDsluCounter, 923 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 1251 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 04:00:11,620 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [232 Valid, 1251 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 04:00:11,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 849 states. [2021-12-18 04:00:11,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 849 to 841. [2021-12-18 04:00:11,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 841 states, 646 states have (on average 1.2879256965944272) internal successors, (832), 646 states have internal predecessors, (832), 138 states have call successors, (138), 57 states have call predecessors, (138), 56 states have return successors, (149), 137 states have call predecessors, (149), 137 states have call successors, (149) [2021-12-18 04:00:11,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 1119 transitions. [2021-12-18 04:00:11,645 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 1119 transitions. Word has length 115 [2021-12-18 04:00:11,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 04:00:11,645 INFO L470 AbstractCegarLoop]: Abstraction has 841 states and 1119 transitions. [2021-12-18 04:00:11,645 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 3 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-18 04:00:11,646 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1119 transitions. [2021-12-18 04:00:11,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2021-12-18 04:00:11,648 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 04:00:11,648 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 04:00:11,664 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-12-18 04:00:11,859 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-12-18 04:00:11,860 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 04:00:11,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 04:00:11,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1880699394, now seen corresponding path program 1 times [2021-12-18 04:00:11,861 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 04:00:11,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1587163633] [2021-12-18 04:00:11,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 04:00:11,861 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 04:00:11,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 04:00:11,862 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-12-18 04:00:11,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-12-18 04:00:12,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 04:00:12,228 INFO L263 TraceCheckSpWp]: Trace formula consists of 635 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-18 04:00:12,231 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 04:00:12,546 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2021-12-18 04:00:12,547 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 04:00:12,547 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 04:00:12,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1587163633] [2021-12-18 04:00:12,547 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1587163633] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 04:00:12,547 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 04:00:12,547 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-18 04:00:12,547 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590363353] [2021-12-18 04:00:12,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 04:00:12,548 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-18 04:00:12,548 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 04:00:12,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-18 04:00:12,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-12-18 04:00:12,548 INFO L87 Difference]: Start difference. First operand 841 states and 1119 transitions. Second operand has 10 states, 10 states have (on average 8.3) internal successors, (83), 8 states have internal predecessors, (83), 4 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 6 states have call predecessors, (11), 3 states have call successors, (11) [2021-12-18 04:00:12,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 04:00:12,734 INFO L93 Difference]: Finished difference Result 1673 states and 2243 transitions. [2021-12-18 04:00:12,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-18 04:00:12,735 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.3) internal successors, (83), 8 states have internal predecessors, (83), 4 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 6 states have call predecessors, (11), 3 states have call successors, (11) Word has length 166 [2021-12-18 04:00:12,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 04:00:12,738 INFO L225 Difference]: With dead ends: 1673 [2021-12-18 04:00:12,738 INFO L226 Difference]: Without dead ends: 841 [2021-12-18 04:00:12,739 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-12-18 04:00:12,740 INFO L933 BasicCegarLoop]: 275 mSDtfsCounter, 16 mSDsluCounter, 2177 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 2452 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 04:00:12,740 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 2452 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 04:00:12,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 841 states. [2021-12-18 04:00:12,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 841 to 841. [2021-12-18 04:00:12,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 841 states, 646 states have (on average 1.2755417956656347) internal successors, (824), 646 states have internal predecessors, (824), 138 states have call successors, (138), 57 states have call predecessors, (138), 56 states have return successors, (149), 137 states have call predecessors, (149), 137 states have call successors, (149) [2021-12-18 04:00:12,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 1111 transitions. [2021-12-18 04:00:12,766 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 1111 transitions. Word has length 166 [2021-12-18 04:00:12,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 04:00:12,766 INFO L470 AbstractCegarLoop]: Abstraction has 841 states and 1111 transitions. [2021-12-18 04:00:12,766 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.3) internal successors, (83), 8 states have internal predecessors, (83), 4 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 6 states have call predecessors, (11), 3 states have call successors, (11) [2021-12-18 04:00:12,766 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1111 transitions. [2021-12-18 04:00:12,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2021-12-18 04:00:12,768 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 04:00:12,769 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 04:00:12,784 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Ended with exit code 0 [2021-12-18 04:00:12,983 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-12-18 04:00:12,984 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 04:00:12,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 04:00:12,984 INFO L85 PathProgramCache]: Analyzing trace with hash -313383669, now seen corresponding path program 1 times [2021-12-18 04:00:12,985 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 04:00:12,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [847234954] [2021-12-18 04:00:12,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 04:00:12,985 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 04:00:12,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 04:00:12,995 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-12-18 04:00:12,999 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-12-18 04:00:13,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 04:00:13,381 INFO L263 TraceCheckSpWp]: Trace formula consists of 661 conjuncts, 25 conjunts are in the unsatisfiable core [2021-12-18 04:00:13,383 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 04:00:13,965 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2021-12-18 04:00:13,965 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 04:00:13,965 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 04:00:13,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [847234954] [2021-12-18 04:00:13,965 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [847234954] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 04:00:13,965 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 04:00:13,966 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-12-18 04:00:13,966 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277259151] [2021-12-18 04:00:13,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 04:00:13,966 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-18 04:00:13,966 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 04:00:13,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-18 04:00:13,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2021-12-18 04:00:13,967 INFO L87 Difference]: Start difference. First operand 841 states and 1111 transitions. Second operand has 13 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 10 states have internal predecessors, (87), 5 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 7 states have call predecessors, (12), 4 states have call successors, (12) [2021-12-18 04:00:14,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 04:00:14,389 INFO L93 Difference]: Finished difference Result 2051 states and 2766 transitions. [2021-12-18 04:00:14,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-18 04:00:14,390 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 10 states have internal predecessors, (87), 5 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 7 states have call predecessors, (12), 4 states have call successors, (12) Word has length 172 [2021-12-18 04:00:14,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 04:00:14,394 INFO L225 Difference]: With dead ends: 2051 [2021-12-18 04:00:14,394 INFO L226 Difference]: Without dead ends: 1219 [2021-12-18 04:00:14,396 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2021-12-18 04:00:14,396 INFO L933 BasicCegarLoop]: 405 mSDtfsCounter, 140 mSDsluCounter, 4278 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 4683 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-18 04:00:14,396 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [166 Valid, 4683 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-18 04:00:14,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1219 states. [2021-12-18 04:00:14,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1219 to 833. [2021-12-18 04:00:14,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 833 states, 638 states have (on average 1.2664576802507836) internal successors, (808), 638 states have internal predecessors, (808), 138 states have call successors, (138), 57 states have call predecessors, (138), 56 states have return successors, (149), 137 states have call predecessors, (149), 137 states have call successors, (149) [2021-12-18 04:00:14,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 833 states to 833 states and 1095 transitions. [2021-12-18 04:00:14,449 INFO L78 Accepts]: Start accepts. Automaton has 833 states and 1095 transitions. Word has length 172 [2021-12-18 04:00:14,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 04:00:14,450 INFO L470 AbstractCegarLoop]: Abstraction has 833 states and 1095 transitions. [2021-12-18 04:00:14,450 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 10 states have internal predecessors, (87), 5 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 7 states have call predecessors, (12), 4 states have call successors, (12) [2021-12-18 04:00:14,450 INFO L276 IsEmpty]: Start isEmpty. Operand 833 states and 1095 transitions. [2021-12-18 04:00:14,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2021-12-18 04:00:14,453 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 04:00:14,453 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 04:00:14,487 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2021-12-18 04:00:14,667 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 04:00:14,668 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 04:00:14,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 04:00:14,668 INFO L85 PathProgramCache]: Analyzing trace with hash -831936403, now seen corresponding path program 1 times [2021-12-18 04:00:14,669 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 04:00:14,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [679260021] [2021-12-18 04:00:14,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 04:00:14,669 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 04:00:14,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 04:00:14,670 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 04:00:14,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-12-18 04:00:15,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 04:00:15,029 INFO L263 TraceCheckSpWp]: Trace formula consists of 641 conjuncts, 25 conjunts are in the unsatisfiable core [2021-12-18 04:00:15,032 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 04:00:15,504 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2021-12-18 04:00:15,505 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 04:00:15,505 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 04:00:15,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [679260021] [2021-12-18 04:00:15,505 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [679260021] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 04:00:15,505 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 04:00:15,505 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-12-18 04:00:15,505 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96456764] [2021-12-18 04:00:15,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 04:00:15,506 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-18 04:00:15,506 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 04:00:15,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-18 04:00:15,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2021-12-18 04:00:15,506 INFO L87 Difference]: Start difference. First operand 833 states and 1095 transitions. Second operand has 13 states, 13 states have (on average 6.615384615384615) internal successors, (86), 10 states have internal predecessors, (86), 5 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 7 states have call predecessors, (12), 4 states have call successors, (12) [2021-12-18 04:00:15,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 04:00:15,817 INFO L93 Difference]: Finished difference Result 2079 states and 2802 transitions. [2021-12-18 04:00:15,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-18 04:00:15,818 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.615384615384615) internal successors, (86), 10 states have internal predecessors, (86), 5 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 7 states have call predecessors, (12), 4 states have call successors, (12) Word has length 171 [2021-12-18 04:00:15,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 04:00:15,821 INFO L225 Difference]: With dead ends: 2079 [2021-12-18 04:00:15,822 INFO L226 Difference]: Without dead ends: 1255 [2021-12-18 04:00:15,823 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2021-12-18 04:00:15,823 INFO L933 BasicCegarLoop]: 405 mSDtfsCounter, 139 mSDsluCounter, 4290 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 4695 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 04:00:15,824 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [165 Valid, 4695 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-18 04:00:15,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1255 states. [2021-12-18 04:00:15,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1255 to 829. [2021-12-18 04:00:15,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 829 states, 634 states have (on average 1.2555205047318612) internal successors, (796), 634 states have internal predecessors, (796), 138 states have call successors, (138), 57 states have call predecessors, (138), 56 states have return successors, (149), 137 states have call predecessors, (149), 137 states have call successors, (149) [2021-12-18 04:00:15,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 829 states to 829 states and 1083 transitions. [2021-12-18 04:00:15,853 INFO L78 Accepts]: Start accepts. Automaton has 829 states and 1083 transitions. Word has length 171 [2021-12-18 04:00:15,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 04:00:15,853 INFO L470 AbstractCegarLoop]: Abstraction has 829 states and 1083 transitions. [2021-12-18 04:00:15,854 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.615384615384615) internal successors, (86), 10 states have internal predecessors, (86), 5 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 7 states have call predecessors, (12), 4 states have call successors, (12) [2021-12-18 04:00:15,854 INFO L276 IsEmpty]: Start isEmpty. Operand 829 states and 1083 transitions. [2021-12-18 04:00:15,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2021-12-18 04:00:15,856 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 04:00:15,856 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 04:00:15,885 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2021-12-18 04:00:16,069 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 04:00:16,070 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 04:00:16,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 04:00:16,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1635967564, now seen corresponding path program 1 times [2021-12-18 04:00:16,071 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 04:00:16,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1245553422] [2021-12-18 04:00:16,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 04:00:16,071 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 04:00:16,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 04:00:16,072 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 04:00:16,073 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-12-18 04:00:16,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 04:00:16,523 INFO L263 TraceCheckSpWp]: Trace formula consists of 835 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-18 04:00:16,526 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 04:00:16,794 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2021-12-18 04:00:16,794 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 04:00:16,794 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 04:00:16,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1245553422] [2021-12-18 04:00:16,795 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1245553422] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 04:00:16,795 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 04:00:16,795 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-18 04:00:16,795 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495244999] [2021-12-18 04:00:16,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 04:00:16,795 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-18 04:00:16,795 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 04:00:16,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-18 04:00:16,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-18 04:00:16,796 INFO L87 Difference]: Start difference. First operand 829 states and 1083 transitions. Second operand has 5 states, 4 states have (on average 26.75) internal successors, (107), 5 states have internal predecessors, (107), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) [2021-12-18 04:00:18,821 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 04:00:19,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 04:00:19,022 INFO L93 Difference]: Finished difference Result 2131 states and 2940 transitions. [2021-12-18 04:00:19,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-18 04:00:19,023 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 26.75) internal successors, (107), 5 states have internal predecessors, (107), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) Word has length 208 [2021-12-18 04:00:19,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 04:00:19,029 INFO L225 Difference]: With dead ends: 2131 [2021-12-18 04:00:19,029 INFO L226 Difference]: Without dead ends: 1311 [2021-12-18 04:00:19,031 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-18 04:00:19,031 INFO L933 BasicCegarLoop]: 422 mSDtfsCounter, 130 mSDsluCounter, 1115 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 1537 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2021-12-18 04:00:19,031 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [162 Valid, 1537 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2021-12-18 04:00:19,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1311 states. [2021-12-18 04:00:19,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1311 to 845. [2021-12-18 04:00:19,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 845 states, 646 states have (on average 1.256965944272446) internal successors, (812), 650 states have internal predecessors, (812), 138 states have call successors, (138), 57 states have call predecessors, (138), 60 states have return successors, (165), 137 states have call predecessors, (165), 137 states have call successors, (165) [2021-12-18 04:00:19,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 845 states and 1115 transitions. [2021-12-18 04:00:19,082 INFO L78 Accepts]: Start accepts. Automaton has 845 states and 1115 transitions. Word has length 208 [2021-12-18 04:00:19,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 04:00:19,083 INFO L470 AbstractCegarLoop]: Abstraction has 845 states and 1115 transitions. [2021-12-18 04:00:19,083 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 26.75) internal successors, (107), 5 states have internal predecessors, (107), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) [2021-12-18 04:00:19,083 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1115 transitions. [2021-12-18 04:00:19,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2021-12-18 04:00:19,086 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 04:00:19,086 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 04:00:19,118 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2021-12-18 04:00:19,303 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 04:00:19,304 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 04:00:19,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 04:00:19,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1643836534, now seen corresponding path program 1 times [2021-12-18 04:00:19,305 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 04:00:19,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [170087065] [2021-12-18 04:00:19,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 04:00:19,305 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 04:00:19,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 04:00:19,306 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 04:00:19,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-12-18 04:00:19,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 04:00:19,905 INFO L263 TraceCheckSpWp]: Trace formula consists of 978 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-18 04:00:19,908 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 04:00:20,209 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2021-12-18 04:00:20,210 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 04:00:20,635 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2021-12-18 04:00:20,636 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 04:00:20,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [170087065] [2021-12-18 04:00:20,636 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [170087065] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 04:00:20,636 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-18 04:00:20,636 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2021-12-18 04:00:20,636 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947113997] [2021-12-18 04:00:20,636 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-18 04:00:20,636 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-18 04:00:20,637 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 04:00:20,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-18 04:00:20,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-12-18 04:00:20,637 INFO L87 Difference]: Start difference. First operand 845 states and 1115 transitions. Second operand has 9 states, 7 states have (on average 17.142857142857142) internal successors, (120), 9 states have internal predecessors, (120), 4 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (19), 2 states have call predecessors, (19), 4 states have call successors, (19) [2021-12-18 04:00:22,666 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 04:00:24,712 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 04:00:25,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 04:00:25,105 INFO L93 Difference]: Finished difference Result 2163 states and 2984 transitions. [2021-12-18 04:00:25,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-18 04:00:25,106 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 17.142857142857142) internal successors, (120), 9 states have internal predecessors, (120), 4 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (19), 2 states have call predecessors, (19), 4 states have call successors, (19) Word has length 209 [2021-12-18 04:00:25,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 04:00:25,111 INFO L225 Difference]: With dead ends: 2163 [2021-12-18 04:00:25,111 INFO L226 Difference]: Without dead ends: 1327 [2021-12-18 04:00:25,112 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 418 GetRequests, 409 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2021-12-18 04:00:25,113 INFO L933 BasicCegarLoop]: 422 mSDtfsCounter, 275 mSDsluCounter, 1106 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 38 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 1528 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2021-12-18 04:00:25,113 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [311 Valid, 1528 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 96 Invalid, 2 Unknown, 0 Unchecked, 4.4s Time] [2021-12-18 04:00:25,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1327 states. [2021-12-18 04:00:25,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1327 to 853. [2021-12-18 04:00:25,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 853 states, 654 states have (on average 1.2660550458715596) internal successors, (828), 658 states have internal predecessors, (828), 138 states have call successors, (138), 57 states have call predecessors, (138), 60 states have return successors, (165), 137 states have call predecessors, (165), 137 states have call successors, (165) [2021-12-18 04:00:25,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 853 states to 853 states and 1131 transitions. [2021-12-18 04:00:25,151 INFO L78 Accepts]: Start accepts. Automaton has 853 states and 1131 transitions. Word has length 209 [2021-12-18 04:00:25,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 04:00:25,151 INFO L470 AbstractCegarLoop]: Abstraction has 853 states and 1131 transitions. [2021-12-18 04:00:25,152 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 17.142857142857142) internal successors, (120), 9 states have internal predecessors, (120), 4 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (19), 2 states have call predecessors, (19), 4 states have call successors, (19) [2021-12-18 04:00:25,152 INFO L276 IsEmpty]: Start isEmpty. Operand 853 states and 1131 transitions. [2021-12-18 04:00:25,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2021-12-18 04:00:25,154 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 04:00:25,154 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-18 04:00:25,189 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2021-12-18 04:00:25,374 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 04:00:25,374 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 04:00:25,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 04:00:25,374 INFO L85 PathProgramCache]: Analyzing trace with hash 1887774604, now seen corresponding path program 2 times [2021-12-18 04:00:25,375 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 04:00:25,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [420425493] [2021-12-18 04:00:25,375 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-18 04:00:25,376 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 04:00:25,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 04:00:25,377 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 04:00:25,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2021-12-18 04:00:25,695 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-12-18 04:00:25,696 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-18 04:00:25,714 INFO L263 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-18 04:00:25,717 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 04:00:26,027 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2021-12-18 04:00:26,027 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 04:00:26,027 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 04:00:26,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [420425493] [2021-12-18 04:00:26,028 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [420425493] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 04:00:26,028 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 04:00:26,028 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-18 04:00:26,028 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440504291] [2021-12-18 04:00:26,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 04:00:26,029 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-18 04:00:26,029 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 04:00:26,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-18 04:00:26,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-18 04:00:26,029 INFO L87 Difference]: Start difference. First operand 853 states and 1131 transitions. Second operand has 5 states, 4 states have (on average 27.0) internal successors, (108), 5 states have internal predecessors, (108), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) [2021-12-18 04:00:28,053 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 04:00:28,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 04:00:28,252 INFO L93 Difference]: Finished difference Result 2187 states and 3052 transitions. [2021-12-18 04:00:28,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-18 04:00:28,253 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 27.0) internal successors, (108), 5 states have internal predecessors, (108), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) Word has length 210 [2021-12-18 04:00:28,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 04:00:28,258 INFO L225 Difference]: With dead ends: 2187 [2021-12-18 04:00:28,258 INFO L226 Difference]: Without dead ends: 1343 [2021-12-18 04:00:28,260 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-18 04:00:28,261 INFO L933 BasicCegarLoop]: 423 mSDtfsCounter, 129 mSDsluCounter, 1116 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 1539 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2021-12-18 04:00:28,261 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [161 Valid, 1539 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2021-12-18 04:00:28,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1343 states. [2021-12-18 04:00:28,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1343 to 857. [2021-12-18 04:00:28,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 857 states, 658 states have (on average 1.2705167173252279) internal successors, (836), 662 states have internal predecessors, (836), 138 states have call successors, (138), 57 states have call predecessors, (138), 60 states have return successors, (165), 137 states have call predecessors, (165), 137 states have call successors, (165) [2021-12-18 04:00:28,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 857 states to 857 states and 1139 transitions. [2021-12-18 04:00:28,295 INFO L78 Accepts]: Start accepts. Automaton has 857 states and 1139 transitions. Word has length 210 [2021-12-18 04:00:28,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 04:00:28,295 INFO L470 AbstractCegarLoop]: Abstraction has 857 states and 1139 transitions. [2021-12-18 04:00:28,295 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 27.0) internal successors, (108), 5 states have internal predecessors, (108), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) [2021-12-18 04:00:28,295 INFO L276 IsEmpty]: Start isEmpty. Operand 857 states and 1139 transitions. [2021-12-18 04:00:28,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2021-12-18 04:00:28,298 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 04:00:28,298 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-18 04:00:28,313 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2021-12-18 04:00:28,511 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 04:00:28,512 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 04:00:28,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 04:00:28,512 INFO L85 PathProgramCache]: Analyzing trace with hash 92345848, now seen corresponding path program 1 times [2021-12-18 04:00:28,513 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 04:00:28,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1712589010] [2021-12-18 04:00:28,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 04:00:28,514 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 04:00:28,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 04:00:28,519 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 04:00:28,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2021-12-18 04:00:29,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 04:00:29,239 INFO L263 TraceCheckSpWp]: Trace formula consists of 1134 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-18 04:00:29,242 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 04:00:29,568 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2021-12-18 04:00:29,569 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 04:00:30,111 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2021-12-18 04:00:30,112 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 04:00:30,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1712589010] [2021-12-18 04:00:30,112 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1712589010] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 04:00:30,112 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-18 04:00:30,112 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-12-18 04:00:30,112 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223965444] [2021-12-18 04:00:30,112 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-18 04:00:30,112 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-18 04:00:30,113 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 04:00:30,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-18 04:00:30,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2021-12-18 04:00:30,113 INFO L87 Difference]: Start difference. First operand 857 states and 1139 transitions. Second operand has 11 states, 9 states have (on average 13.666666666666666) internal successors, (123), 11 states have internal predecessors, (123), 4 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (19), 2 states have call predecessors, (19), 4 states have call successors, (19) [2021-12-18 04:00:32,153 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 04:00:34,204 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 04:00:36,256 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 04:00:36,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 04:00:36,996 INFO L93 Difference]: Finished difference Result 2215 states and 3148 transitions. [2021-12-18 04:00:36,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-18 04:00:36,999 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 13.666666666666666) internal successors, (123), 11 states have internal predecessors, (123), 4 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (19), 2 states have call predecessors, (19), 4 states have call successors, (19) Word has length 211 [2021-12-18 04:00:36,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 04:00:37,007 INFO L225 Difference]: With dead ends: 2215 [2021-12-18 04:00:37,008 INFO L226 Difference]: Without dead ends: 1367 [2021-12-18 04:00:37,012 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 423 GetRequests, 411 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2021-12-18 04:00:37,013 INFO L933 BasicCegarLoop]: 423 mSDtfsCounter, 162 mSDsluCounter, 1804 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 5 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 2227 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2021-12-18 04:00:37,013 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [202 Valid, 2227 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 198 Invalid, 3 Unknown, 0 Unchecked, 6.8s Time] [2021-12-18 04:00:37,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1367 states. [2021-12-18 04:00:37,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1367 to 861. [2021-12-18 04:00:37,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 861 states, 662 states have (on average 1.2749244712990937) internal successors, (844), 666 states have internal predecessors, (844), 138 states have call successors, (138), 57 states have call predecessors, (138), 60 states have return successors, (165), 137 states have call predecessors, (165), 137 states have call successors, (165) [2021-12-18 04:00:37,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 861 states to 861 states and 1147 transitions. [2021-12-18 04:00:37,077 INFO L78 Accepts]: Start accepts. Automaton has 861 states and 1147 transitions. Word has length 211 [2021-12-18 04:00:37,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 04:00:37,078 INFO L470 AbstractCegarLoop]: Abstraction has 861 states and 1147 transitions. [2021-12-18 04:00:37,078 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 13.666666666666666) internal successors, (123), 11 states have internal predecessors, (123), 4 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (19), 2 states have call predecessors, (19), 4 states have call successors, (19) [2021-12-18 04:00:37,078 INFO L276 IsEmpty]: Start isEmpty. Operand 861 states and 1147 transitions. [2021-12-18 04:00:37,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2021-12-18 04:00:37,081 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 04:00:37,081 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 04:00:37,105 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Ended with exit code 0 [2021-12-18 04:00:37,303 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 04:00:37,303 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 04:00:37,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 04:00:37,304 INFO L85 PathProgramCache]: Analyzing trace with hash -1706370162, now seen corresponding path program 2 times [2021-12-18 04:00:37,304 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 04:00:37,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1559296929] [2021-12-18 04:00:37,305 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-18 04:00:37,305 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 04:00:37,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 04:00:37,306 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 04:00:37,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2021-12-18 04:00:38,465 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-18 04:00:38,465 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-18 04:00:38,537 INFO L263 TraceCheckSpWp]: Trace formula consists of 1277 conjuncts, 16 conjunts are in the unsatisfiable core [2021-12-18 04:00:38,541 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 04:00:39,196 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 35 proven. 28 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2021-12-18 04:00:39,196 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 04:00:41,354 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 214 trivial. 0 not checked. [2021-12-18 04:00:41,354 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 04:00:41,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1559296929] [2021-12-18 04:00:41,354 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1559296929] provided 1 perfect and 1 imperfect interpolant sequences [2021-12-18 04:00:41,355 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-18 04:00:41,355 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [9] total 18 [2021-12-18 04:00:41,355 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398221328] [2021-12-18 04:00:41,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 04:00:41,356 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-18 04:00:41,356 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 04:00:41,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-18 04:00:41,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2021-12-18 04:00:41,357 INFO L87 Difference]: Start difference. First operand 861 states and 1147 transitions. Second operand has 12 states, 12 states have (on average 9.083333333333334) internal successors, (109), 12 states have internal predecessors, (109), 7 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (16), 7 states have call predecessors, (16), 6 states have call successors, (16) [2021-12-18 04:00:43,751 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 04:00:45,757 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 04:00:49,232 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 04:00:51,240 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 04:00:54,444 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 04:00:56,460 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 04:00:58,465 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 04:00:59,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 04:00:59,225 INFO L93 Difference]: Finished difference Result 2718 states and 3633 transitions. [2021-12-18 04:00:59,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-18 04:00:59,227 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 9.083333333333334) internal successors, (109), 12 states have internal predecessors, (109), 7 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (16), 7 states have call predecessors, (16), 6 states have call successors, (16) Word has length 212 [2021-12-18 04:00:59,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 04:00:59,235 INFO L225 Difference]: With dead ends: 2718 [2021-12-18 04:00:59,235 INFO L226 Difference]: Without dead ends: 2279 [2021-12-18 04:00:59,237 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 434 GetRequests, 407 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=206, Invalid=550, Unknown=0, NotChecked=0, Total=756 [2021-12-18 04:00:59,237 INFO L933 BasicCegarLoop]: 421 mSDtfsCounter, 2018 mSDsluCounter, 1712 mSDsCounter, 0 mSdLazyCounter, 1025 mSolverCounterSat, 596 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2039 SdHoareTripleChecker+Valid, 2133 SdHoareTripleChecker+Invalid, 1628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 596 IncrementalHoareTripleChecker+Valid, 1025 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.1s IncrementalHoareTripleChecker+Time [2021-12-18 04:00:59,238 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2039 Valid, 2133 Invalid, 1628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [596 Valid, 1025 Invalid, 7 Unknown, 0 Unchecked, 17.1s Time] [2021-12-18 04:00:59,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2279 states. [2021-12-18 04:00:59,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2279 to 2149. [2021-12-18 04:00:59,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2149 states, 1646 states have (on average 1.2770352369380316) internal successors, (2102), 1662 states have internal predecessors, (2102), 342 states have call successors, (342), 141 states have call predecessors, (342), 160 states have return successors, (441), 345 states have call predecessors, (441), 341 states have call successors, (441) [2021-12-18 04:00:59,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2149 states to 2149 states and 2885 transitions. [2021-12-18 04:00:59,352 INFO L78 Accepts]: Start accepts. Automaton has 2149 states and 2885 transitions. Word has length 212 [2021-12-18 04:00:59,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 04:00:59,352 INFO L470 AbstractCegarLoop]: Abstraction has 2149 states and 2885 transitions. [2021-12-18 04:00:59,353 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.083333333333334) internal successors, (109), 12 states have internal predecessors, (109), 7 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (16), 7 states have call predecessors, (16), 6 states have call successors, (16) [2021-12-18 04:00:59,353 INFO L276 IsEmpty]: Start isEmpty. Operand 2149 states and 2885 transitions. [2021-12-18 04:00:59,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2021-12-18 04:00:59,362 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 04:00:59,363 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 04:00:59,390 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Ended with exit code 0 [2021-12-18 04:00:59,579 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 04:00:59,579 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 04:00:59,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 04:00:59,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1365199469, now seen corresponding path program 1 times [2021-12-18 04:00:59,581 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 04:00:59,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1823276810] [2021-12-18 04:00:59,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 04:00:59,581 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 04:00:59,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 04:00:59,582 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 04:00:59,583 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2021-12-18 04:01:00,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 04:01:00,448 INFO L263 TraceCheckSpWp]: Trace formula consists of 1281 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-18 04:01:00,451 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 04:01:00,771 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2021-12-18 04:01:00,771 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 04:01:01,473 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2021-12-18 04:01:01,473 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 04:01:01,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1823276810] [2021-12-18 04:01:01,473 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1823276810] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 04:01:01,473 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-18 04:01:01,474 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2021-12-18 04:01:01,474 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516734559] [2021-12-18 04:01:01,474 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-18 04:01:01,474 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-18 04:01:01,474 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 04:01:01,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-18 04:01:01,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2021-12-18 04:01:01,475 INFO L87 Difference]: Start difference. First operand 2149 states and 2885 transitions. Second operand has 13 states, 11 states have (on average 11.727272727272727) internal successors, (129), 13 states have internal predecessors, (129), 4 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (19), 2 states have call predecessors, (19), 4 states have call successors, (19) [2021-12-18 04:01:03,508 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 04:01:05,557 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 04:01:07,609 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 04:01:09,692 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 04:01:10,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 04:01:10,635 INFO L93 Difference]: Finished difference Result 5585 states and 8076 transitions. [2021-12-18 04:01:10,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-18 04:01:10,636 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 11.727272727272727) internal successors, (129), 13 states have internal predecessors, (129), 4 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (19), 2 states have call predecessors, (19), 4 states have call successors, (19) Word has length 214 [2021-12-18 04:01:10,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 04:01:10,652 INFO L225 Difference]: With dead ends: 5585 [2021-12-18 04:01:10,652 INFO L226 Difference]: Without dead ends: 3445 [2021-12-18 04:01:10,657 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 430 GetRequests, 415 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2021-12-18 04:01:10,659 INFO L933 BasicCegarLoop]: 424 mSDtfsCounter, 316 mSDsluCounter, 1940 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 53 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 2364 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.0s IncrementalHoareTripleChecker+Time [2021-12-18 04:01:10,659 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [360 Valid, 2364 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 282 Invalid, 4 Unknown, 0 Unchecked, 9.0s Time] [2021-12-18 04:01:10,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3445 states. [2021-12-18 04:01:10,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3445 to 2159. [2021-12-18 04:01:10,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2159 states, 1656 states have (on average 1.2814009661835748) internal successors, (2122), 1672 states have internal predecessors, (2122), 342 states have call successors, (342), 141 states have call predecessors, (342), 160 states have return successors, (441), 345 states have call predecessors, (441), 341 states have call successors, (441) [2021-12-18 04:01:10,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2159 states to 2159 states and 2905 transitions. [2021-12-18 04:01:10,779 INFO L78 Accepts]: Start accepts. Automaton has 2159 states and 2905 transitions. Word has length 214 [2021-12-18 04:01:10,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 04:01:10,779 INFO L470 AbstractCegarLoop]: Abstraction has 2159 states and 2905 transitions. [2021-12-18 04:01:10,779 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 11.727272727272727) internal successors, (129), 13 states have internal predecessors, (129), 4 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (19), 2 states have call predecessors, (19), 4 states have call successors, (19) [2021-12-18 04:01:10,780 INFO L276 IsEmpty]: Start isEmpty. Operand 2159 states and 2905 transitions. [2021-12-18 04:01:10,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2021-12-18 04:01:10,785 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 04:01:10,785 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 04:01:10,813 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2021-12-18 04:01:11,002 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 04:01:11,002 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 04:01:11,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 04:01:11,003 INFO L85 PathProgramCache]: Analyzing trace with hash -574287132, now seen corresponding path program 1 times [2021-12-18 04:01:11,004 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 04:01:11,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2101251913] [2021-12-18 04:01:11,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 04:01:11,004 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 04:01:11,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 04:01:11,006 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 04:01:11,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2021-12-18 04:01:11,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 04:01:11,553 INFO L263 TraceCheckSpWp]: Trace formula consists of 848 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-18 04:01:11,556 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 04:01:11,844 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2021-12-18 04:01:11,844 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 04:01:11,844 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 04:01:11,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2101251913] [2021-12-18 04:01:11,844 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2101251913] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 04:01:11,844 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 04:01:11,844 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-18 04:01:11,844 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394117351] [2021-12-18 04:01:11,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 04:01:11,845 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-18 04:01:11,845 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 04:01:11,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-18 04:01:11,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 04:01:11,845 INFO L87 Difference]: Start difference. First operand 2159 states and 2905 transitions. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2021-12-18 04:01:11,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 04:01:11,976 INFO L93 Difference]: Finished difference Result 5235 states and 7148 transitions. [2021-12-18 04:01:11,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-18 04:01:11,977 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 226 [2021-12-18 04:01:11,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 04:01:11,988 INFO L225 Difference]: With dead ends: 5235 [2021-12-18 04:01:11,988 INFO L226 Difference]: Without dead ends: 3085 [2021-12-18 04:01:11,992 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 04:01:11,993 INFO L933 BasicCegarLoop]: 408 mSDtfsCounter, 116 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 677 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 04:01:11,993 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [137 Valid, 677 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 04:01:11,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3085 states. [2021-12-18 04:01:12,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3085 to 2139. [2021-12-18 04:01:12,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2139 states, 1646 states have (on average 1.2770352369380316) internal successors, (2102), 1662 states have internal predecessors, (2102), 332 states have call successors, (332), 141 states have call predecessors, (332), 160 states have return successors, (421), 335 states have call predecessors, (421), 331 states have call successors, (421) [2021-12-18 04:01:12,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2139 states to 2139 states and 2855 transitions. [2021-12-18 04:01:12,125 INFO L78 Accepts]: Start accepts. Automaton has 2139 states and 2855 transitions. Word has length 226 [2021-12-18 04:01:12,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 04:01:12,126 INFO L470 AbstractCegarLoop]: Abstraction has 2139 states and 2855 transitions. [2021-12-18 04:01:12,126 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2021-12-18 04:01:12,126 INFO L276 IsEmpty]: Start isEmpty. Operand 2139 states and 2855 transitions. [2021-12-18 04:01:12,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2021-12-18 04:01:12,130 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 04:01:12,130 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 04:01:12,167 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2021-12-18 04:01:12,346 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 04:01:12,347 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 04:01:12,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 04:01:12,347 INFO L85 PathProgramCache]: Analyzing trace with hash 932737188, now seen corresponding path program 1 times [2021-12-18 04:01:12,348 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 04:01:12,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2140919812] [2021-12-18 04:01:12,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 04:01:12,348 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 04:01:12,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 04:01:12,350 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 04:01:12,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2021-12-18 04:01:12,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 04:01:12,904 INFO L263 TraceCheckSpWp]: Trace formula consists of 848 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-18 04:01:12,907 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 04:01:13,244 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 211 trivial. 0 not checked. [2021-12-18 04:01:13,244 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 04:01:13,244 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 04:01:13,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2140919812] [2021-12-18 04:01:13,244 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2140919812] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 04:01:13,244 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 04:01:13,244 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-18 04:01:13,245 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313902876] [2021-12-18 04:01:13,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 04:01:13,245 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-18 04:01:13,245 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 04:01:13,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-18 04:01:13,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-18 04:01:13,246 INFO L87 Difference]: Start difference. First operand 2139 states and 2855 transitions. Second operand has 5 states, 5 states have (on average 23.6) internal successors, (118), 5 states have internal predecessors, (118), 3 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2021-12-18 04:01:15,275 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 04:01:15,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 04:01:15,535 INFO L93 Difference]: Finished difference Result 5235 states and 7128 transitions. [2021-12-18 04:01:15,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-18 04:01:15,536 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.6) internal successors, (118), 5 states have internal predecessors, (118), 3 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) Word has length 226 [2021-12-18 04:01:15,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 04:01:15,546 INFO L225 Difference]: With dead ends: 5235 [2021-12-18 04:01:15,546 INFO L226 Difference]: Without dead ends: 3105 [2021-12-18 04:01:15,550 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-18 04:01:15,551 INFO L933 BasicCegarLoop]: 403 mSDtfsCounter, 118 mSDsluCounter, 1066 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 1469 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2021-12-18 04:01:15,552 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [141 Valid, 1469 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2021-12-18 04:01:15,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3105 states. [2021-12-18 04:01:15,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3105 to 2159. [2021-12-18 04:01:15,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2159 states, 1656 states have (on average 1.2753623188405796) internal successors, (2112), 1682 states have internal predecessors, (2112), 332 states have call successors, (332), 141 states have call predecessors, (332), 170 states have return successors, (441), 335 states have call predecessors, (441), 331 states have call successors, (441) [2021-12-18 04:01:15,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2159 states to 2159 states and 2885 transitions. [2021-12-18 04:01:15,671 INFO L78 Accepts]: Start accepts. Automaton has 2159 states and 2885 transitions. Word has length 226 [2021-12-18 04:01:15,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 04:01:15,672 INFO L470 AbstractCegarLoop]: Abstraction has 2159 states and 2885 transitions. [2021-12-18 04:01:15,673 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.6) internal successors, (118), 5 states have internal predecessors, (118), 3 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2021-12-18 04:01:15,673 INFO L276 IsEmpty]: Start isEmpty. Operand 2159 states and 2885 transitions. [2021-12-18 04:01:15,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2021-12-18 04:01:15,676 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 04:01:15,676 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 04:01:15,694 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2021-12-18 04:01:15,891 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 04:01:15,892 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 04:01:15,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 04:01:15,893 INFO L85 PathProgramCache]: Analyzing trace with hash -352993496, now seen corresponding path program 1 times [2021-12-18 04:01:15,894 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 04:01:15,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [177030544] [2021-12-18 04:01:15,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 04:01:15,895 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 04:01:15,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 04:01:15,897 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 04:01:15,898 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2021-12-18 04:01:16,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 04:01:16,607 INFO L263 TraceCheckSpWp]: Trace formula consists of 991 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-18 04:01:16,610 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 04:01:16,981 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 211 trivial. 0 not checked. [2021-12-18 04:01:16,982 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 04:01:17,401 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked. [2021-12-18 04:01:17,401 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 04:01:17,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [177030544] [2021-12-18 04:01:17,401 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [177030544] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 04:01:17,401 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-18 04:01:17,402 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2021-12-18 04:01:17,402 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8427186] [2021-12-18 04:01:17,402 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-18 04:01:17,403 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-18 04:01:17,403 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 04:01:17,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-18 04:01:17,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-12-18 04:01:17,403 INFO L87 Difference]: Start difference. First operand 2159 states and 2885 transitions. Second operand has 9 states, 9 states have (on average 15.333333333333334) internal successors, (138), 9 states have internal predecessors, (138), 4 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (22), 2 states have call predecessors, (22), 4 states have call successors, (22) [2021-12-18 04:01:19,477 WARN L534 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-12-18 04:01:21,513 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 04:01:21,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 04:01:21,854 INFO L93 Difference]: Finished difference Result 5285 states and 7208 transitions. [2021-12-18 04:01:21,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-18 04:01:21,855 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 15.333333333333334) internal successors, (138), 9 states have internal predecessors, (138), 4 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (22), 2 states have call predecessors, (22), 4 states have call successors, (22) Word has length 227 [2021-12-18 04:01:21,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 04:01:21,881 INFO L225 Difference]: With dead ends: 5285 [2021-12-18 04:01:21,881 INFO L226 Difference]: Without dead ends: 3135 [2021-12-18 04:01:21,885 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 455 GetRequests, 446 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2021-12-18 04:01:21,886 INFO L933 BasicCegarLoop]: 403 mSDtfsCounter, 241 mSDsluCounter, 1862 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 27 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 2265 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2021-12-18 04:01:21,886 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [266 Valid, 2265 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 59 Invalid, 2 Unknown, 0 Unchecked, 4.3s Time] [2021-12-18 04:01:21,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3135 states. [2021-12-18 04:01:21,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3135 to 2169. [2021-12-18 04:01:21,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2169 states, 1666 states have (on average 1.2797118847539015) internal successors, (2132), 1692 states have internal predecessors, (2132), 332 states have call successors, (332), 141 states have call predecessors, (332), 170 states have return successors, (441), 335 states have call predecessors, (441), 331 states have call successors, (441) [2021-12-18 04:01:22,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2169 states to 2169 states and 2905 transitions. [2021-12-18 04:01:22,001 INFO L78 Accepts]: Start accepts. Automaton has 2169 states and 2905 transitions. Word has length 227 [2021-12-18 04:01:22,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 04:01:22,002 INFO L470 AbstractCegarLoop]: Abstraction has 2169 states and 2905 transitions. [2021-12-18 04:01:22,002 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 15.333333333333334) internal successors, (138), 9 states have internal predecessors, (138), 4 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (22), 2 states have call predecessors, (22), 4 states have call successors, (22) [2021-12-18 04:01:22,003 INFO L276 IsEmpty]: Start isEmpty. Operand 2169 states and 2905 transitions. [2021-12-18 04:01:22,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2021-12-18 04:01:22,006 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 04:01:22,006 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 04:01:22,039 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Ended with exit code 0 [2021-12-18 04:01:22,225 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 04:01:22,226 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 04:01:22,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 04:01:22,226 INFO L85 PathProgramCache]: Analyzing trace with hash -171469545, now seen corresponding path program 2 times [2021-12-18 04:01:22,227 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 04:01:22,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1187377876] [2021-12-18 04:01:22,227 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-18 04:01:22,227 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 04:01:22,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 04:01:22,236 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 04:01:22,237 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2021-12-18 04:01:22,675 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-12-18 04:01:22,675 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-18 04:01:22,694 INFO L263 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-18 04:01:22,697 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 04:01:22,938 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2021-12-18 04:01:22,938 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 04:01:22,938 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 04:01:22,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1187377876] [2021-12-18 04:01:22,938 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1187377876] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 04:01:22,938 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 04:01:22,938 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-18 04:01:22,938 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501532631] [2021-12-18 04:01:22,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 04:01:22,939 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-18 04:01:22,939 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 04:01:22,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-18 04:01:22,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-18 04:01:22,939 INFO L87 Difference]: Start difference. First operand 2169 states and 2905 transitions. Second operand has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 1 states have call successors, (16) [2021-12-18 04:01:23,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 04:01:23,108 INFO L93 Difference]: Finished difference Result 4423 states and 5969 transitions. [2021-12-18 04:01:23,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-18 04:01:23,109 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 1 states have call successors, (16) Word has length 215 [2021-12-18 04:01:23,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 04:01:23,115 INFO L225 Difference]: With dead ends: 4423 [2021-12-18 04:01:23,116 INFO L226 Difference]: Without dead ends: 2263 [2021-12-18 04:01:23,120 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-18 04:01:23,120 INFO L933 BasicCegarLoop]: 275 mSDtfsCounter, 10 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 808 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 04:01:23,121 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 808 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 04:01:23,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2263 states. [2021-12-18 04:01:23,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2263 to 2209. [2021-12-18 04:01:23,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2209 states, 1706 states have (on average 1.2837045720984759) internal successors, (2190), 1732 states have internal predecessors, (2190), 332 states have call successors, (332), 141 states have call predecessors, (332), 170 states have return successors, (441), 335 states have call predecessors, (441), 331 states have call successors, (441) [2021-12-18 04:01:23,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2209 states to 2209 states and 2963 transitions. [2021-12-18 04:01:23,227 INFO L78 Accepts]: Start accepts. Automaton has 2209 states and 2963 transitions. Word has length 215 [2021-12-18 04:01:23,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 04:01:23,227 INFO L470 AbstractCegarLoop]: Abstraction has 2209 states and 2963 transitions. [2021-12-18 04:01:23,227 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 1 states have call successors, (16) [2021-12-18 04:01:23,227 INFO L276 IsEmpty]: Start isEmpty. Operand 2209 states and 2963 transitions. [2021-12-18 04:01:23,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2021-12-18 04:01:23,231 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 04:01:23,231 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 04:01:23,250 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2021-12-18 04:01:23,443 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 04:01:23,444 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 04:01:23,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 04:01:23,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1115335037, now seen corresponding path program 1 times [2021-12-18 04:01:23,445 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 04:01:23,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [282125182] [2021-12-18 04:01:23,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 04:01:23,445 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 04:01:23,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 04:01:23,446 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 04:01:23,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2021-12-18 04:01:24,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 04:01:24,273 INFO L263 TraceCheckSpWp]: Trace formula consists of 1134 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-18 04:01:24,276 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 04:01:24,649 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 211 trivial. 0 not checked. [2021-12-18 04:01:24,649 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 04:01:25,274 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked. [2021-12-18 04:01:25,274 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 04:01:25,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [282125182] [2021-12-18 04:01:25,275 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [282125182] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 04:01:25,275 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-18 04:01:25,275 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-12-18 04:01:25,275 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549516172] [2021-12-18 04:01:25,275 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-18 04:01:25,275 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-18 04:01:25,275 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 04:01:25,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-18 04:01:25,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2021-12-18 04:01:25,276 INFO L87 Difference]: Start difference. First operand 2209 states and 2963 transitions. Second operand has 11 states, 11 states have (on average 12.909090909090908) internal successors, (142), 11 states have internal predecessors, (142), 4 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (22), 2 states have call predecessors, (22), 4 states have call successors, (22) [2021-12-18 04:01:27,321 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 04:01:29,370 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 04:01:31,417 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 04:01:31,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 04:01:31,931 INFO L93 Difference]: Finished difference Result 5405 states and 7394 transitions. [2021-12-18 04:01:31,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-18 04:01:31,933 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 12.909090909090908) internal successors, (142), 11 states have internal predecessors, (142), 4 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (22), 2 states have call predecessors, (22), 4 states have call successors, (22) Word has length 229 [2021-12-18 04:01:31,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 04:01:31,942 INFO L225 Difference]: With dead ends: 5405 [2021-12-18 04:01:31,942 INFO L226 Difference]: Without dead ends: 3205 [2021-12-18 04:01:31,947 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 461 GetRequests, 449 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2021-12-18 04:01:31,947 INFO L933 BasicCegarLoop]: 404 mSDtfsCounter, 140 mSDsluCounter, 2925 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 5 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 3329 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2021-12-18 04:01:31,947 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [167 Valid, 3329 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 127 Invalid, 3 Unknown, 0 Unchecked, 6.5s Time] [2021-12-18 04:01:31,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3205 states. [2021-12-18 04:01:32,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3205 to 2209. [2021-12-18 04:01:32,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2209 states, 1706 states have (on average 1.2837045720984759) internal successors, (2190), 1732 states have internal predecessors, (2190), 332 states have call successors, (332), 141 states have call predecessors, (332), 170 states have return successors, (441), 335 states have call predecessors, (441), 331 states have call successors, (441) [2021-12-18 04:01:32,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2209 states to 2209 states and 2963 transitions. [2021-12-18 04:01:32,063 INFO L78 Accepts]: Start accepts. Automaton has 2209 states and 2963 transitions. Word has length 229 [2021-12-18 04:01:32,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 04:01:32,064 INFO L470 AbstractCegarLoop]: Abstraction has 2209 states and 2963 transitions. [2021-12-18 04:01:32,064 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.909090909090908) internal successors, (142), 11 states have internal predecessors, (142), 4 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (22), 2 states have call predecessors, (22), 4 states have call successors, (22) [2021-12-18 04:01:32,064 INFO L276 IsEmpty]: Start isEmpty. Operand 2209 states and 2963 transitions. [2021-12-18 04:01:32,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2021-12-18 04:01:32,068 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 04:01:32,068 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 04:01:32,109 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2021-12-18 04:01:32,283 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 04:01:32,283 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 04:01:32,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 04:01:32,284 INFO L85 PathProgramCache]: Analyzing trace with hash -1697357260, now seen corresponding path program 1 times [2021-12-18 04:01:32,285 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 04:01:32,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1516051785] [2021-12-18 04:01:32,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 04:01:32,285 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 04:01:32,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 04:01:32,286 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 04:01:32,286 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2021-12-18 04:01:33,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 04:01:33,278 INFO L263 TraceCheckSpWp]: Trace formula consists of 1424 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-18 04:01:33,307 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 04:01:33,674 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2021-12-18 04:01:33,674 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 04:01:34,610 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2021-12-18 04:01:34,610 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 04:01:34,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1516051785] [2021-12-18 04:01:34,610 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1516051785] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 04:01:34,610 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-18 04:01:34,610 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2021-12-18 04:01:34,610 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201223369] [2021-12-18 04:01:34,610 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-18 04:01:34,611 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-12-18 04:01:34,611 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 04:01:34,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-18 04:01:34,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2021-12-18 04:01:34,611 INFO L87 Difference]: Start difference. First operand 2209 states and 2963 transitions. Second operand has 15 states, 13 states have (on average 10.23076923076923) internal successors, (133), 15 states have internal predecessors, (133), 4 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (19), 2 states have call predecessors, (19), 4 states have call successors, (19) [2021-12-18 04:01:36,660 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 04:01:38,709 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 04:01:40,771 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 04:01:42,869 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 04:01:44,954 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 04:01:46,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 04:01:46,247 INFO L93 Difference]: Finished difference Result 5685 states and 8062 transitions. [2021-12-18 04:01:46,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-18 04:01:46,250 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 10.23076923076923) internal successors, (133), 15 states have internal predecessors, (133), 4 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (19), 2 states have call predecessors, (19), 4 states have call successors, (19) Word has length 216 [2021-12-18 04:01:46,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 04:01:46,259 INFO L225 Difference]: With dead ends: 5685 [2021-12-18 04:01:46,260 INFO L226 Difference]: Without dead ends: 3485 [2021-12-18 04:01:46,264 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 435 GetRequests, 417 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=93, Invalid=287, Unknown=0, NotChecked=0, Total=380 [2021-12-18 04:01:46,264 INFO L933 BasicCegarLoop]: 419 mSDtfsCounter, 174 mSDsluCounter, 5088 mSDsCounter, 0 mSdLazyCounter, 474 mSolverCounterSat, 14 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 5507 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 474 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.4s IncrementalHoareTripleChecker+Time [2021-12-18 04:01:46,265 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [213 Valid, 5507 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 474 Invalid, 5 Unknown, 0 Unchecked, 11.4s Time] [2021-12-18 04:01:46,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3485 states. [2021-12-18 04:01:46,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3485 to 2219. [2021-12-18 04:01:46,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2219 states, 1716 states have (on average 1.2878787878787878) internal successors, (2210), 1742 states have internal predecessors, (2210), 332 states have call successors, (332), 141 states have call predecessors, (332), 170 states have return successors, (441), 335 states have call predecessors, (441), 331 states have call successors, (441) [2021-12-18 04:01:46,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2219 states to 2219 states and 2983 transitions. [2021-12-18 04:01:46,392 INFO L78 Accepts]: Start accepts. Automaton has 2219 states and 2983 transitions. Word has length 216 [2021-12-18 04:01:46,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 04:01:46,393 INFO L470 AbstractCegarLoop]: Abstraction has 2219 states and 2983 transitions. [2021-12-18 04:01:46,393 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 10.23076923076923) internal successors, (133), 15 states have internal predecessors, (133), 4 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (19), 2 states have call predecessors, (19), 4 states have call successors, (19) [2021-12-18 04:01:46,393 INFO L276 IsEmpty]: Start isEmpty. Operand 2219 states and 2983 transitions. [2021-12-18 04:01:46,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2021-12-18 04:01:46,396 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 04:01:46,396 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 04:01:46,426 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2021-12-18 04:01:46,617 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 04:01:46,618 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 04:01:46,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 04:01:46,618 INFO L85 PathProgramCache]: Analyzing trace with hash 430873721, now seen corresponding path program 2 times [2021-12-18 04:01:46,619 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 04:01:46,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1824649098] [2021-12-18 04:01:46,619 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-18 04:01:46,619 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 04:01:46,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 04:01:46,620 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 04:01:46,621 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2021-12-18 04:01:47,088 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-12-18 04:01:47,088 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-18 04:01:47,098 INFO L263 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-18 04:01:47,101 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 04:01:47,432 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2021-12-18 04:01:47,433 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 04:01:47,433 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 04:01:47,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1824649098] [2021-12-18 04:01:47,433 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1824649098] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 04:01:47,433 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 04:01:47,433 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-18 04:01:47,433 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708200848] [2021-12-18 04:01:47,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 04:01:47,433 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-18 04:01:47,434 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 04:01:47,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-18 04:01:47,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 04:01:47,434 INFO L87 Difference]: Start difference. First operand 2219 states and 2983 transitions. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (18), 2 states have call predecessors, (18), 1 states have call successors, (18) [2021-12-18 04:01:47,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 04:01:47,529 INFO L93 Difference]: Finished difference Result 4009 states and 5423 transitions. [2021-12-18 04:01:47,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-18 04:01:47,529 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (18), 2 states have call predecessors, (18), 1 states have call successors, (18) Word has length 230 [2021-12-18 04:01:47,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 04:01:47,533 INFO L225 Difference]: With dead ends: 4009 [2021-12-18 04:01:47,533 INFO L226 Difference]: Without dead ends: 2229 [2021-12-18 04:01:47,536 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 04:01:47,536 INFO L933 BasicCegarLoop]: 272 mSDtfsCounter, 5 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 04:01:47,537 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 536 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 04:01:47,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2229 states. [2021-12-18 04:01:47,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2229 to 2229. [2021-12-18 04:01:47,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2229 states, 1726 states have (on average 1.2850521436848203) internal successors, (2218), 1752 states have internal predecessors, (2218), 332 states have call successors, (332), 141 states have call predecessors, (332), 170 states have return successors, (441), 335 states have call predecessors, (441), 331 states have call successors, (441) [2021-12-18 04:01:47,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2229 states to 2229 states and 2991 transitions. [2021-12-18 04:01:47,641 INFO L78 Accepts]: Start accepts. Automaton has 2229 states and 2991 transitions. Word has length 230 [2021-12-18 04:01:47,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 04:01:47,641 INFO L470 AbstractCegarLoop]: Abstraction has 2229 states and 2991 transitions. [2021-12-18 04:01:47,642 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (18), 2 states have call predecessors, (18), 1 states have call successors, (18) [2021-12-18 04:01:47,642 INFO L276 IsEmpty]: Start isEmpty. Operand 2229 states and 2991 transitions. [2021-12-18 04:01:47,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2021-12-18 04:01:47,645 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 04:01:47,645 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 04:01:47,669 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2021-12-18 04:01:47,870 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 04:01:47,870 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 04:01:47,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 04:01:47,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1228007192, now seen corresponding path program 1 times [2021-12-18 04:01:47,872 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 04:01:47,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [743783216] [2021-12-18 04:01:47,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 04:01:47,872 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 04:01:47,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 04:01:47,873 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 04:01:47,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2021-12-18 04:01:48,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 04:01:48,838 INFO L263 TraceCheckSpWp]: Trace formula consists of 1281 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-18 04:01:48,841 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 04:01:49,222 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 211 trivial. 0 not checked. [2021-12-18 04:01:49,223 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 04:01:49,985 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 7 proven. 13 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked. [2021-12-18 04:01:49,985 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 04:01:49,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [743783216] [2021-12-18 04:01:49,985 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [743783216] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 04:01:49,985 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-18 04:01:49,986 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2021-12-18 04:01:49,986 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884562856] [2021-12-18 04:01:49,986 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-18 04:01:49,986 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-18 04:01:49,986 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 04:01:49,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-18 04:01:49,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2021-12-18 04:01:49,987 INFO L87 Difference]: Start difference. First operand 2229 states and 2991 transitions. Second operand has 13 states, 13 states have (on average 11.384615384615385) internal successors, (148), 13 states have internal predecessors, (148), 4 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (22), 2 states have call predecessors, (22), 4 states have call successors, (22) [2021-12-18 04:01:52,052 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 04:01:54,109 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 04:01:56,173 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 04:01:58,255 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 04:01:58,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 04:01:58,820 INFO L93 Difference]: Finished difference Result 5475 states and 7500 transitions. [2021-12-18 04:01:58,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-18 04:01:58,821 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 11.384615384615385) internal successors, (148), 13 states have internal predecessors, (148), 4 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (22), 2 states have call predecessors, (22), 4 states have call successors, (22) Word has length 232 [2021-12-18 04:01:58,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 04:01:58,828 INFO L225 Difference]: With dead ends: 5475 [2021-12-18 04:01:58,828 INFO L226 Difference]: Without dead ends: 3255 [2021-12-18 04:01:58,831 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 469 GetRequests, 454 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2021-12-18 04:01:58,832 INFO L933 BasicCegarLoop]: 405 mSDtfsCounter, 181 mSDsluCounter, 2133 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 9 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 2538 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.6s IncrementalHoareTripleChecker+Time [2021-12-18 04:01:58,832 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [210 Valid, 2538 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 150 Invalid, 4 Unknown, 0 Unchecked, 8.6s Time] [2021-12-18 04:01:58,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3255 states. [2021-12-18 04:01:58,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3255 to 2229. [2021-12-18 04:01:58,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2229 states, 1726 states have (on average 1.2850521436848203) internal successors, (2218), 1752 states have internal predecessors, (2218), 332 states have call successors, (332), 141 states have call predecessors, (332), 170 states have return successors, (441), 335 states have call predecessors, (441), 331 states have call successors, (441) [2021-12-18 04:01:58,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2229 states to 2229 states and 2991 transitions. [2021-12-18 04:01:58,924 INFO L78 Accepts]: Start accepts. Automaton has 2229 states and 2991 transitions. Word has length 232 [2021-12-18 04:01:58,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 04:01:58,925 INFO L470 AbstractCegarLoop]: Abstraction has 2229 states and 2991 transitions. [2021-12-18 04:01:58,925 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 11.384615384615385) internal successors, (148), 13 states have internal predecessors, (148), 4 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (22), 2 states have call predecessors, (22), 4 states have call successors, (22) [2021-12-18 04:01:58,925 INFO L276 IsEmpty]: Start isEmpty. Operand 2229 states and 2991 transitions. [2021-12-18 04:01:58,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2021-12-18 04:01:58,928 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 04:01:58,928 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-18 04:01:58,954 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2021-12-18 04:01:59,145 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 04:01:59,145 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 04:01:59,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 04:01:59,145 INFO L85 PathProgramCache]: Analyzing trace with hash 770345830, now seen corresponding path program 1 times [2021-12-18 04:01:59,146 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 04:01:59,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1603652731] [2021-12-18 04:01:59,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 04:01:59,147 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 04:01:59,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 04:01:59,151 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 04:01:59,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2021-12-18 04:02:00,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 04:02:00,407 INFO L263 TraceCheckSpWp]: Trace formula consists of 1569 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-18 04:02:00,410 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 04:02:00,802 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2021-12-18 04:02:00,802 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 04:02:01,823 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2021-12-18 04:02:01,824 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 04:02:01,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1603652731] [2021-12-18 04:02:01,824 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1603652731] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 04:02:01,824 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-18 04:02:01,824 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2021-12-18 04:02:01,824 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133051496] [2021-12-18 04:02:01,824 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-18 04:02:01,825 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-18 04:02:01,825 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 04:02:01,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-18 04:02:01,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2021-12-18 04:02:01,825 INFO L87 Difference]: Start difference. First operand 2229 states and 2991 transitions. Second operand has 17 states, 15 states have (on average 9.0) internal successors, (135), 17 states have internal predecessors, (135), 4 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (19), 2 states have call predecessors, (19), 4 states have call successors, (19) [2021-12-18 04:02:03,875 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 04:02:05,928 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 04:02:07,997 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 04:02:10,089 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 04:02:12,181 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 04:02:14,286 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 04:02:15,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 04:02:15,736 INFO L93 Difference]: Finished difference Result 5755 states and 8188 transitions. [2021-12-18 04:02:15,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-18 04:02:15,737 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 9.0) internal successors, (135), 17 states have internal predecessors, (135), 4 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (19), 2 states have call predecessors, (19), 4 states have call successors, (19) Word has length 218 [2021-12-18 04:02:15,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 04:02:15,744 INFO L225 Difference]: With dead ends: 5755 [2021-12-18 04:02:15,744 INFO L226 Difference]: Without dead ends: 3535 [2021-12-18 04:02:15,748 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 440 GetRequests, 419 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=119, Invalid=387, Unknown=0, NotChecked=0, Total=506 [2021-12-18 04:02:15,750 INFO L933 BasicCegarLoop]: 420 mSDtfsCounter, 350 mSDsluCounter, 3580 mSDsCounter, 0 mSdLazyCounter, 450 mSolverCounterSat, 61 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 391 SdHoareTripleChecker+Valid, 4000 SdHoareTripleChecker+Invalid, 517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 450 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.6s IncrementalHoareTripleChecker+Time [2021-12-18 04:02:15,751 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [391 Valid, 4000 Invalid, 517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 450 Invalid, 6 Unknown, 0 Unchecked, 13.6s Time] [2021-12-18 04:02:15,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3535 states. [2021-12-18 04:02:15,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3535 to 2239. [2021-12-18 04:02:15,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2239 states, 1736 states have (on average 1.2891705069124424) internal successors, (2238), 1762 states have internal predecessors, (2238), 332 states have call successors, (332), 141 states have call predecessors, (332), 170 states have return successors, (441), 335 states have call predecessors, (441), 331 states have call successors, (441) [2021-12-18 04:02:15,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2239 states to 2239 states and 3011 transitions. [2021-12-18 04:02:15,871 INFO L78 Accepts]: Start accepts. Automaton has 2239 states and 3011 transitions. Word has length 218 [2021-12-18 04:02:15,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 04:02:15,871 INFO L470 AbstractCegarLoop]: Abstraction has 2239 states and 3011 transitions. [2021-12-18 04:02:15,872 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 9.0) internal successors, (135), 17 states have internal predecessors, (135), 4 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (19), 2 states have call predecessors, (19), 4 states have call successors, (19) [2021-12-18 04:02:15,872 INFO L276 IsEmpty]: Start isEmpty. Operand 2239 states and 3011 transitions. [2021-12-18 04:02:15,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2021-12-18 04:02:15,875 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 04:02:15,875 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 04:02:15,902 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Forceful destruction successful, exit code 0 [2021-12-18 04:02:16,102 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 04:02:16,102 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 04:02:16,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 04:02:16,102 INFO L85 PathProgramCache]: Analyzing trace with hash -1349303652, now seen corresponding path program 2 times [2021-12-18 04:02:16,103 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 04:02:16,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [265333183] [2021-12-18 04:02:16,105 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-18 04:02:16,105 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 04:02:16,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 04:02:16,106 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 04:02:16,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2021-12-18 04:02:16,637 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-12-18 04:02:16,637 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-18 04:02:16,648 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 14 conjunts are in the unsatisfiable core [2021-12-18 04:02:16,650 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 04:02:17,237 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 230 trivial. 0 not checked. [2021-12-18 04:02:17,237 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 04:02:17,237 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 04:02:17,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [265333183] [2021-12-18 04:02:17,238 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [265333183] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 04:02:17,238 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 04:02:17,238 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-12-18 04:02:17,238 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210413177] [2021-12-18 04:02:17,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 04:02:17,238 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-18 04:02:17,238 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 04:02:17,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-18 04:02:17,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2021-12-18 04:02:17,239 INFO L87 Difference]: Start difference. First operand 2239 states and 3011 transitions. Second operand has 12 states, 12 states have (on average 9.833333333333334) internal successors, (118), 12 states have internal predecessors, (118), 4 states have call successors, (19), 4 states have call predecessors, (19), 3 states have return successors, (18), 4 states have call predecessors, (18), 3 states have call successors, (18) [2021-12-18 04:02:20,123 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 04:02:22,132 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 04:02:24,142 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 04:02:26,159 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 04:02:28,173 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 04:02:30,187 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 04:02:32,198 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 04:02:36,091 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 04:02:38,097 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 04:02:40,111 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 04:02:42,123 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 04:02:44,130 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 04:02:46,143 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 04:02:48,152 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 04:02:50,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 04:02:50,116 INFO L93 Difference]: Finished difference Result 6796 states and 9186 transitions. [2021-12-18 04:02:50,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-12-18 04:02:50,117 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 9.833333333333334) internal successors, (118), 12 states have internal predecessors, (118), 4 states have call successors, (19), 4 states have call predecessors, (19), 3 states have return successors, (18), 4 states have call predecessors, (18), 3 states have call successors, (18) Word has length 233 [2021-12-18 04:02:50,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 04:02:50,136 INFO L225 Difference]: With dead ends: 6796 [2021-12-18 04:02:50,136 INFO L226 Difference]: Without dead ends: 4561 [2021-12-18 04:02:50,142 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=196, Invalid=926, Unknown=0, NotChecked=0, Total=1122 [2021-12-18 04:02:50,142 INFO L933 BasicCegarLoop]: 315 mSDtfsCounter, 1140 mSDsluCounter, 1811 mSDsCounter, 0 mSdLazyCounter, 1720 mSolverCounterSat, 335 mSolverCounterUnsat, 14 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 31.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1186 SdHoareTripleChecker+Valid, 2126 SdHoareTripleChecker+Invalid, 2069 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 335 IncrementalHoareTripleChecker+Valid, 1720 IncrementalHoareTripleChecker+Invalid, 14 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 32.0s IncrementalHoareTripleChecker+Time [2021-12-18 04:02:50,142 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1186 Valid, 2126 Invalid, 2069 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [335 Valid, 1720 Invalid, 14 Unknown, 0 Unchecked, 32.0s Time] [2021-12-18 04:02:50,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4561 states. [2021-12-18 04:02:50,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4561 to 3717. [2021-12-18 04:02:50,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3717 states, 2906 states have (on average 1.2794218857536133) internal successors, (3718), 2952 states have internal predecessors, (3718), 520 states have call successors, (520), 241 states have call predecessors, (520), 290 states have return successors, (697), 523 states have call predecessors, (697), 519 states have call successors, (697) [2021-12-18 04:02:50,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3717 states to 3717 states and 4935 transitions. [2021-12-18 04:02:50,367 INFO L78 Accepts]: Start accepts. Automaton has 3717 states and 4935 transitions. Word has length 233 [2021-12-18 04:02:50,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 04:02:50,368 INFO L470 AbstractCegarLoop]: Abstraction has 3717 states and 4935 transitions. [2021-12-18 04:02:50,368 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.833333333333334) internal successors, (118), 12 states have internal predecessors, (118), 4 states have call successors, (19), 4 states have call predecessors, (19), 3 states have return successors, (18), 4 states have call predecessors, (18), 3 states have call successors, (18) [2021-12-18 04:02:50,368 INFO L276 IsEmpty]: Start isEmpty. Operand 3717 states and 4935 transitions. [2021-12-18 04:02:50,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2021-12-18 04:02:50,370 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 04:02:50,371 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 04:02:50,397 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (28)] Ended with exit code 0 [2021-12-18 04:02:50,582 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 04:02:50,583 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 04:02:50,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 04:02:50,583 INFO L85 PathProgramCache]: Analyzing trace with hash 233887179, now seen corresponding path program 1 times [2021-12-18 04:02:50,584 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 04:02:50,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1847274010] [2021-12-18 04:02:50,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 04:02:50,585 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 04:02:50,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 04:02:50,596 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 04:02:50,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2021-12-18 04:02:51,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 04:02:51,761 INFO L263 TraceCheckSpWp]: Trace formula consists of 1422 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-18 04:02:51,764 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 04:02:52,207 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 16 proven. 10 refuted. 0 times theorem prover too weak. 213 trivial. 0 not checked. [2021-12-18 04:02:52,207 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 04:02:53,307 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 7 proven. 18 refuted. 0 times theorem prover too weak. 214 trivial. 0 not checked. [2021-12-18 04:02:53,307 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 04:02:53,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1847274010] [2021-12-18 04:02:53,309 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1847274010] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 04:02:53,309 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-18 04:02:53,309 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2021-12-18 04:02:53,309 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399690869] [2021-12-18 04:02:53,309 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-18 04:02:53,310 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-12-18 04:02:53,310 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 04:02:53,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-18 04:02:53,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2021-12-18 04:02:53,311 INFO L87 Difference]: Start difference. First operand 3717 states and 4935 transitions. Second operand has 15 states, 15 states have (on average 9.733333333333333) internal successors, (146), 15 states have internal predecessors, (146), 4 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (22), 2 states have call predecessors, (22), 4 states have call successors, (22) [2021-12-18 04:02:55,360 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 04:02:57,469 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 04:02:59,537 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 04:03:01,646 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 04:03:03,738 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 04:03:04,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 04:03:04,537 INFO L93 Difference]: Finished difference Result 8911 states and 12104 transitions. [2021-12-18 04:03:04,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-18 04:03:04,538 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 9.733333333333333) internal successors, (146), 15 states have internal predecessors, (146), 4 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (22), 2 states have call predecessors, (22), 4 states have call successors, (22) Word has length 232 [2021-12-18 04:03:04,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 04:03:04,549 INFO L225 Difference]: With dead ends: 8911 [2021-12-18 04:03:04,550 INFO L226 Difference]: Without dead ends: 5421 [2021-12-18 04:03:04,555 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 471 GetRequests, 453 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=93, Invalid=287, Unknown=0, NotChecked=0, Total=380 [2021-12-18 04:03:04,556 INFO L933 BasicCegarLoop]: 406 mSDtfsCounter, 303 mSDsluCounter, 2670 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 45 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 3076 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.8s IncrementalHoareTripleChecker+Time [2021-12-18 04:03:04,556 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [334 Valid, 3076 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 207 Invalid, 5 Unknown, 0 Unchecked, 10.8s Time] [2021-12-18 04:03:04,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5421 states. [2021-12-18 04:03:04,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5421 to 3717. [2021-12-18 04:03:04,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3717 states, 2906 states have (on average 1.2794218857536133) internal successors, (3718), 2952 states have internal predecessors, (3718), 520 states have call successors, (520), 241 states have call predecessors, (520), 290 states have return successors, (697), 523 states have call predecessors, (697), 519 states have call successors, (697) [2021-12-18 04:03:04,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3717 states to 3717 states and 4935 transitions. [2021-12-18 04:03:04,790 INFO L78 Accepts]: Start accepts. Automaton has 3717 states and 4935 transitions. Word has length 232 [2021-12-18 04:03:04,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 04:03:04,791 INFO L470 AbstractCegarLoop]: Abstraction has 3717 states and 4935 transitions. [2021-12-18 04:03:04,791 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 9.733333333333333) internal successors, (146), 15 states have internal predecessors, (146), 4 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (22), 2 states have call predecessors, (22), 4 states have call successors, (22) [2021-12-18 04:03:04,791 INFO L276 IsEmpty]: Start isEmpty. Operand 3717 states and 4935 transitions. [2021-12-18 04:03:04,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2021-12-18 04:03:04,793 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 04:03:04,793 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-18 04:03:04,835 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (29)] Forceful destruction successful, exit code 0 [2021-12-18 04:03:05,020 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 04:03:05,020 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 04:03:05,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 04:03:05,020 INFO L85 PathProgramCache]: Analyzing trace with hash 2054779152, now seen corresponding path program 2 times [2021-12-18 04:03:05,021 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 04:03:05,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1260036012] [2021-12-18 04:03:05,021 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-18 04:03:05,021 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 04:03:05,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 04:03:05,023 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 04:03:05,024 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2021-12-18 04:03:06,845 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-18 04:03:06,845 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-18 04:03:06,963 INFO L263 TraceCheckSpWp]: Trace formula consists of 1712 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-18 04:03:06,966 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 04:03:07,418 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 7 proven. 21 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2021-12-18 04:03:07,418 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 04:03:08,711 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 7 proven. 21 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2021-12-18 04:03:08,711 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 04:03:08,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1260036012] [2021-12-18 04:03:08,711 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1260036012] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 04:03:08,711 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-18 04:03:08,711 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-12-18 04:03:08,711 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257209733] [2021-12-18 04:03:08,711 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-18 04:03:08,712 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-12-18 04:03:08,712 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 04:03:08,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-12-18 04:03:08,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2021-12-18 04:03:08,712 INFO L87 Difference]: Start difference. First operand 3717 states and 4935 transitions. Second operand has 19 states, 17 states have (on average 8.058823529411764) internal successors, (137), 19 states have internal predecessors, (137), 4 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (19), 2 states have call predecessors, (19), 4 states have call successors, (19) [2021-12-18 04:03:10,827 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 04:03:12,891 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 04:03:14,972 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 04:03:17,086 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 04:03:19,207 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 04:03:21,317 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 04:03:23,425 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 04:03:25,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 04:03:25,325 INFO L93 Difference]: Finished difference Result 9199 states and 12860 transitions. [2021-12-18 04:03:25,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-18 04:03:25,326 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 8.058823529411764) internal successors, (137), 19 states have internal predecessors, (137), 4 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (19), 2 states have call predecessors, (19), 4 states have call successors, (19) Word has length 219 [2021-12-18 04:03:25,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 04:03:25,339 INFO L225 Difference]: With dead ends: 9199 [2021-12-18 04:03:25,339 INFO L226 Difference]: Without dead ends: 5709 [2021-12-18 04:03:25,344 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 443 GetRequests, 419 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=148, Invalid=502, Unknown=0, NotChecked=0, Total=650 [2021-12-18 04:03:25,345 INFO L933 BasicCegarLoop]: 421 mSDtfsCounter, 405 mSDsluCounter, 3587 mSDsCounter, 0 mSdLazyCounter, 540 mSolverCounterSat, 70 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 448 SdHoareTripleChecker+Valid, 4008 SdHoareTripleChecker+Invalid, 617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 540 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.1s IncrementalHoareTripleChecker+Time [2021-12-18 04:03:25,345 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [448 Valid, 4008 Invalid, 617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 540 Invalid, 7 Unknown, 0 Unchecked, 16.1s Time] [2021-12-18 04:03:25,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5709 states. [2021-12-18 04:03:25,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5709 to 3727. [2021-12-18 04:03:25,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3727 states, 2916 states have (on average 1.2818930041152263) internal successors, (3738), 2962 states have internal predecessors, (3738), 520 states have call successors, (520), 241 states have call predecessors, (520), 290 states have return successors, (697), 523 states have call predecessors, (697), 519 states have call successors, (697) [2021-12-18 04:03:25,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3727 states to 3727 states and 4955 transitions. [2021-12-18 04:03:25,606 INFO L78 Accepts]: Start accepts. Automaton has 3727 states and 4955 transitions. Word has length 219 [2021-12-18 04:03:25,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 04:03:25,606 INFO L470 AbstractCegarLoop]: Abstraction has 3727 states and 4955 transitions. [2021-12-18 04:03:25,606 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 8.058823529411764) internal successors, (137), 19 states have internal predecessors, (137), 4 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (19), 2 states have call predecessors, (19), 4 states have call successors, (19) [2021-12-18 04:03:25,606 INFO L276 IsEmpty]: Start isEmpty. Operand 3727 states and 4955 transitions. [2021-12-18 04:03:25,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2021-12-18 04:03:25,609 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 04:03:25,611 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 04:03:25,659 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (30)] Forceful destruction successful, exit code 0 [2021-12-18 04:03:25,827 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 04:03:25,828 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 04:03:25,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 04:03:25,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1951543631, now seen corresponding path program 2 times [2021-12-18 04:03:25,829 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 04:03:25,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [692982405] [2021-12-18 04:03:25,829 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-18 04:03:25,829 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 04:03:25,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 04:03:25,830 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 04:03:25,836 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2021-12-18 04:03:27,150 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-18 04:03:27,150 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-18 04:03:27,236 INFO L263 TraceCheckSpWp]: Trace formula consists of 1565 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-18 04:03:27,239 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 04:03:27,567 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2021-12-18 04:03:27,568 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 04:03:27,568 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 04:03:27,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [692982405] [2021-12-18 04:03:27,568 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [692982405] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 04:03:27,568 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 04:03:27,568 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-18 04:03:27,568 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599597362] [2021-12-18 04:03:27,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 04:03:27,568 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-18 04:03:27,568 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 04:03:27,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-18 04:03:27,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 04:03:27,569 INFO L87 Difference]: Start difference. First operand 3727 states and 4955 transitions. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 3 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2021-12-18 04:03:27,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 04:03:27,884 INFO L93 Difference]: Finished difference Result 9135 states and 12490 transitions. [2021-12-18 04:03:27,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-18 04:03:27,886 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 3 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 233 [2021-12-18 04:03:27,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 04:03:27,895 INFO L225 Difference]: With dead ends: 9135 [2021-12-18 04:03:27,895 INFO L226 Difference]: Without dead ends: 5635 [2021-12-18 04:03:27,899 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 04:03:27,900 INFO L933 BasicCegarLoop]: 432 mSDtfsCounter, 110 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 721 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 04:03:27,900 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [129 Valid, 721 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 04:03:27,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5635 states. [2021-12-18 04:03:28,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5635 to 3947. [2021-12-18 04:03:28,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3947 states, 3046 states have (on average 1.273145108338805) internal successors, (3878), 3102 states have internal predecessors, (3878), 610 states have call successors, (610), 241 states have call predecessors, (610), 290 states have return successors, (861), 603 states have call predecessors, (861), 609 states have call successors, (861) [2021-12-18 04:03:28,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3947 states to 3947 states and 5349 transitions. [2021-12-18 04:03:28,156 INFO L78 Accepts]: Start accepts. Automaton has 3947 states and 5349 transitions. Word has length 233 [2021-12-18 04:03:28,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 04:03:28,157 INFO L470 AbstractCegarLoop]: Abstraction has 3947 states and 5349 transitions. [2021-12-18 04:03:28,157 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 3 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2021-12-18 04:03:28,157 INFO L276 IsEmpty]: Start isEmpty. Operand 3947 states and 5349 transitions. [2021-12-18 04:03:28,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2021-12-18 04:03:28,159 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 04:03:28,160 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 04:03:28,189 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (31)] Forceful destruction successful, exit code 0 [2021-12-18 04:03:28,371 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 04:03:28,372 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 04:03:28,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 04:03:28,372 INFO L85 PathProgramCache]: Analyzing trace with hash 109067917, now seen corresponding path program 1 times [2021-12-18 04:03:28,373 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 04:03:28,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [516130352] [2021-12-18 04:03:28,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 04:03:28,373 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 04:03:28,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 04:03:28,382 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 04:03:28,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (32)] Waiting until timeout for monitored process [2021-12-18 04:03:29,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 04:03:29,850 INFO L263 TraceCheckSpWp]: Trace formula consists of 1565 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-18 04:03:29,853 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 04:03:30,241 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 228 trivial. 0 not checked. [2021-12-18 04:03:30,242 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 04:03:30,242 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 04:03:30,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [516130352] [2021-12-18 04:03:30,242 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [516130352] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 04:03:30,242 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 04:03:30,242 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-18 04:03:30,242 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066706277] [2021-12-18 04:03:30,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 04:03:30,243 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-18 04:03:30,243 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 04:03:30,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-18 04:03:30,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-18 04:03:30,243 INFO L87 Difference]: Start difference. First operand 3947 states and 5349 transitions. Second operand has 5 states, 5 states have (on average 24.0) internal successors, (120), 5 states have internal predecessors, (120), 3 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2021-12-18 04:03:32,280 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 04:03:32,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 04:03:32,746 INFO L93 Difference]: Finished difference Result 9319 states and 12898 transitions. [2021-12-18 04:03:32,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-18 04:03:32,747 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.0) internal successors, (120), 5 states have internal predecessors, (120), 3 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) Word has length 233 [2021-12-18 04:03:32,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 04:03:32,758 INFO L225 Difference]: With dead ends: 9319 [2021-12-18 04:03:32,758 INFO L226 Difference]: Without dead ends: 5601 [2021-12-18 04:03:32,764 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 229 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-18 04:03:32,765 INFO L933 BasicCegarLoop]: 404 mSDtfsCounter, 117 mSDsluCounter, 1067 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 1471 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2021-12-18 04:03:32,766 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [140 Valid, 1471 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 1 Unknown, 0 Unchecked, 2.1s Time] [2021-12-18 04:03:32,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5601 states. [2021-12-18 04:03:33,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5601 to 3957. [2021-12-18 04:03:33,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3957 states, 3056 states have (on average 1.2755235602094241) internal successors, (3898), 3112 states have internal predecessors, (3898), 610 states have call successors, (610), 241 states have call predecessors, (610), 290 states have return successors, (861), 603 states have call predecessors, (861), 609 states have call successors, (861) [2021-12-18 04:03:33,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3957 states to 3957 states and 5369 transitions. [2021-12-18 04:03:33,053 INFO L78 Accepts]: Start accepts. Automaton has 3957 states and 5369 transitions. Word has length 233 [2021-12-18 04:03:33,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 04:03:33,053 INFO L470 AbstractCegarLoop]: Abstraction has 3957 states and 5369 transitions. [2021-12-18 04:03:33,053 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.0) internal successors, (120), 5 states have internal predecessors, (120), 3 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2021-12-18 04:03:33,053 INFO L276 IsEmpty]: Start isEmpty. Operand 3957 states and 5369 transitions. [2021-12-18 04:03:33,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2021-12-18 04:03:33,056 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 04:03:33,056 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 04:03:33,101 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (32)] Forceful destruction successful, exit code 0 [2021-12-18 04:03:33,271 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 04:03:33,273 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 04:03:33,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 04:03:33,273 INFO L85 PathProgramCache]: Analyzing trace with hash 1944951883, now seen corresponding path program 1 times [2021-12-18 04:03:33,274 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 04:03:33,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [583304227] [2021-12-18 04:03:33,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 04:03:33,274 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 04:03:33,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 04:03:33,284 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 04:03:33,311 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (33)] Waiting until timeout for monitored process [2021-12-18 04:03:34,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 04:03:34,791 INFO L263 TraceCheckSpWp]: Trace formula consists of 1578 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-18 04:03:34,793 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 04:03:35,135 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 230 trivial. 0 not checked. [2021-12-18 04:03:35,135 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 04:03:35,135 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 04:03:35,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [583304227] [2021-12-18 04:03:35,135 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [583304227] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 04:03:35,135 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 04:03:35,136 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-18 04:03:35,136 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287851381] [2021-12-18 04:03:35,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 04:03:35,136 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-18 04:03:35,136 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 04:03:35,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-18 04:03:35,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-18 04:03:35,137 INFO L87 Difference]: Start difference. First operand 3957 states and 5369 transitions. Second operand has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 3 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2021-12-18 04:03:37,175 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 04:03:37,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 04:03:37,567 INFO L93 Difference]: Finished difference Result 9259 states and 12708 transitions. [2021-12-18 04:03:37,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-18 04:03:37,568 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 3 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) Word has length 234 [2021-12-18 04:03:37,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 04:03:37,579 INFO L225 Difference]: With dead ends: 9259 [2021-12-18 04:03:37,579 INFO L226 Difference]: Without dead ends: 5501 [2021-12-18 04:03:37,584 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-18 04:03:37,584 INFO L933 BasicCegarLoop]: 401 mSDtfsCounter, 113 mSDsluCounter, 1066 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 1467 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2021-12-18 04:03:37,584 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [132 Valid, 1467 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 1 Unknown, 0 Unchecked, 2.1s Time] [2021-12-18 04:03:37,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5501 states. [2021-12-18 04:03:37,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5501 to 3907. [2021-12-18 04:03:37,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3907 states, 3026 states have (on average 1.2683410442828817) internal successors, (3838), 3082 states have internal predecessors, (3838), 590 states have call successors, (590), 241 states have call predecessors, (590), 290 states have return successors, (801), 583 states have call predecessors, (801), 589 states have call successors, (801) [2021-12-18 04:03:37,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3907 states to 3907 states and 5229 transitions. [2021-12-18 04:03:37,859 INFO L78 Accepts]: Start accepts. Automaton has 3907 states and 5229 transitions. Word has length 234 [2021-12-18 04:03:37,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 04:03:37,860 INFO L470 AbstractCegarLoop]: Abstraction has 3907 states and 5229 transitions. [2021-12-18 04:03:37,860 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 3 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2021-12-18 04:03:37,861 INFO L276 IsEmpty]: Start isEmpty. Operand 3907 states and 5229 transitions. [2021-12-18 04:03:37,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2021-12-18 04:03:37,864 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 04:03:37,864 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-18 04:03:37,893 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (33)] Forceful destruction successful, exit code 0 [2021-12-18 04:03:38,079 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 04:03:38,079 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 04:03:38,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 04:03:38,080 INFO L85 PathProgramCache]: Analyzing trace with hash -1077460826, now seen corresponding path program 3 times [2021-12-18 04:03:38,081 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 04:03:38,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1495975136] [2021-12-18 04:03:38,081 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-18 04:03:38,081 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 04:03:38,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 04:03:38,082 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 04:03:38,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (34)] Waiting until timeout for monitored process [2021-12-18 04:03:39,607 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-12-18 04:03:39,607 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-18 04:03:39,664 INFO L263 TraceCheckSpWp]: Trace formula consists of 874 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-18 04:03:39,667 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 04:03:40,016 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 237 trivial. 0 not checked. [2021-12-18 04:03:40,017 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 04:03:40,524 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 237 trivial. 0 not checked. [2021-12-18 04:03:40,525 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 04:03:40,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1495975136] [2021-12-18 04:03:40,525 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1495975136] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 04:03:40,525 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-18 04:03:40,525 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2021-12-18 04:03:40,525 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548168668] [2021-12-18 04:03:40,525 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-18 04:03:40,526 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-18 04:03:40,526 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 04:03:40,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-18 04:03:40,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-12-18 04:03:40,526 INFO L87 Difference]: Start difference. First operand 3907 states and 5229 transitions. Second operand has 9 states, 7 states have (on average 18.142857142857142) internal successors, (127), 9 states have internal predecessors, (127), 4 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (19), 2 states have call predecessors, (19), 4 states have call successors, (19) [2021-12-18 04:03:42,564 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 04:03:43,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 04:03:43,221 INFO L93 Difference]: Finished difference Result 9675 states and 13544 transitions. [2021-12-18 04:03:43,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-18 04:03:43,224 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 18.142857142857142) internal successors, (127), 9 states have internal predecessors, (127), 4 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (19), 2 states have call predecessors, (19), 4 states have call successors, (19) Word has length 220 [2021-12-18 04:03:43,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 04:03:43,236 INFO L225 Difference]: With dead ends: 9675 [2021-12-18 04:03:43,236 INFO L226 Difference]: Without dead ends: 5997 [2021-12-18 04:03:43,241 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 440 GetRequests, 431 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2021-12-18 04:03:43,241 INFO L933 BasicCegarLoop]: 412 mSDtfsCounter, 132 mSDsluCounter, 2173 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 2585 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2021-12-18 04:03:43,241 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [161 Valid, 2585 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 76 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2021-12-18 04:03:43,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5997 states. [2021-12-18 04:03:43,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5997 to 3917. [2021-12-18 04:03:43,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3917 states, 3036 states have (on average 1.2707509881422925) internal successors, (3858), 3092 states have internal predecessors, (3858), 590 states have call successors, (590), 241 states have call predecessors, (590), 290 states have return successors, (801), 583 states have call predecessors, (801), 589 states have call successors, (801) [2021-12-18 04:03:43,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3917 states to 3917 states and 5249 transitions. [2021-12-18 04:03:43,490 INFO L78 Accepts]: Start accepts. Automaton has 3917 states and 5249 transitions. Word has length 220 [2021-12-18 04:03:43,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 04:03:43,490 INFO L470 AbstractCegarLoop]: Abstraction has 3917 states and 5249 transitions. [2021-12-18 04:03:43,490 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 18.142857142857142) internal successors, (127), 9 states have internal predecessors, (127), 4 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (19), 2 states have call predecessors, (19), 4 states have call successors, (19) [2021-12-18 04:03:43,491 INFO L276 IsEmpty]: Start isEmpty. Operand 3917 states and 5249 transitions. [2021-12-18 04:03:43,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2021-12-18 04:03:43,493 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 04:03:43,493 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 04:03:43,522 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (34)] Forceful destruction successful, exit code 0 [2021-12-18 04:03:43,719 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 04:03:43,720 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 04:03:43,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 04:03:43,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1936601813, now seen corresponding path program 2 times [2021-12-18 04:03:43,721 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 04:03:43,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1294093010] [2021-12-18 04:03:43,721 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-18 04:03:43,721 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 04:03:43,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 04:03:43,722 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 04:03:43,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (35)] Waiting until timeout for monitored process [2021-12-18 04:03:45,403 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-18 04:03:45,404 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-18 04:03:45,514 INFO L263 TraceCheckSpWp]: Trace formula consists of 1721 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-18 04:03:45,517 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 04:03:45,794 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 243 trivial. 0 not checked. [2021-12-18 04:03:45,794 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 04:03:45,795 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 04:03:45,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1294093010] [2021-12-18 04:03:45,795 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1294093010] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 04:03:45,795 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 04:03:45,795 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-18 04:03:45,795 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793690641] [2021-12-18 04:03:45,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 04:03:45,796 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-18 04:03:45,796 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 04:03:45,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-18 04:03:45,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-18 04:03:45,796 INFO L87 Difference]: Start difference. First operand 3917 states and 5249 transitions. Second operand has 5 states, 5 states have (on average 24.0) internal successors, (120), 5 states have internal predecessors, (120), 3 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2021-12-18 04:03:47,830 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 04:03:48,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 04:03:48,269 INFO L93 Difference]: Finished difference Result 9229 states and 12588 transitions. [2021-12-18 04:03:48,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-18 04:03:48,270 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.0) internal successors, (120), 5 states have internal predecessors, (120), 3 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) Word has length 235 [2021-12-18 04:03:48,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 04:03:48,281 INFO L225 Difference]: With dead ends: 9229 [2021-12-18 04:03:48,281 INFO L226 Difference]: Without dead ends: 5521 [2021-12-18 04:03:48,303 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-18 04:03:48,304 INFO L933 BasicCegarLoop]: 402 mSDtfsCounter, 112 mSDsluCounter, 1067 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 1469 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2021-12-18 04:03:48,304 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [131 Valid, 1469 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 1 Unknown, 0 Unchecked, 2.1s Time] [2021-12-18 04:03:48,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5521 states. [2021-12-18 04:03:48,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5521 to 3927. [2021-12-18 04:03:48,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3927 states, 3046 states have (on average 1.263296126066973) internal successors, (3848), 3102 states have internal predecessors, (3848), 590 states have call successors, (590), 241 states have call predecessors, (590), 290 states have return successors, (801), 583 states have call predecessors, (801), 589 states have call successors, (801) [2021-12-18 04:03:48,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3927 states to 3927 states and 5239 transitions. [2021-12-18 04:03:48,596 INFO L78 Accepts]: Start accepts. Automaton has 3927 states and 5239 transitions. Word has length 235 [2021-12-18 04:03:48,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 04:03:48,596 INFO L470 AbstractCegarLoop]: Abstraction has 3927 states and 5239 transitions. [2021-12-18 04:03:48,596 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.0) internal successors, (120), 5 states have internal predecessors, (120), 3 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2021-12-18 04:03:48,596 INFO L276 IsEmpty]: Start isEmpty. Operand 3927 states and 5239 transitions. [2021-12-18 04:03:48,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2021-12-18 04:03:48,599 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 04:03:48,599 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 04:03:48,643 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (35)] Forceful destruction successful, exit code 0 [2021-12-18 04:03:48,823 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 04:03:48,824 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 04:03:48,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 04:03:48,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1697025614, now seen corresponding path program 4 times [2021-12-18 04:03:48,825 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 04:03:48,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [382692016] [2021-12-18 04:03:48,825 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-18 04:03:48,825 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 04:03:48,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 04:03:48,827 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 04:03:48,827 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (36)] Waiting until timeout for monitored process [2021-12-18 04:03:50,566 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-18 04:03:50,567 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-18 04:03:50,687 INFO L263 TraceCheckSpWp]: Trace formula consists of 1868 conjuncts, 13 conjunts are in the unsatisfiable core [2021-12-18 04:03:50,690 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 04:03:51,158 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 7 proven. 28 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked. [2021-12-18 04:03:51,158 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 04:03:52,843 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 7 proven. 28 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked. [2021-12-18 04:03:52,843 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 04:03:52,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [382692016] [2021-12-18 04:03:52,844 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [382692016] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 04:03:52,844 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-18 04:03:52,844 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2021-12-18 04:03:52,844 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752552826] [2021-12-18 04:03:52,844 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-18 04:03:52,845 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-12-18 04:03:52,845 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 04:03:52,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-12-18 04:03:52,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=336, Unknown=0, NotChecked=0, Total=420 [2021-12-18 04:03:52,845 INFO L87 Difference]: Start difference. First operand 3927 states and 5239 transitions. Second operand has 21 states, 19 states have (on average 7.315789473684211) internal successors, (139), 21 states have internal predecessors, (139), 4 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (19), 2 states have call predecessors, (19), 4 states have call successors, (19) [2021-12-18 04:03:54,911 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 04:03:56,926 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 04:03:58,997 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 04:04:01,103 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 04:04:03,224 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 04:04:05,402 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 04:04:07,540 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 04:04:09,708 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 04:04:11,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 04:04:11,442 INFO L93 Difference]: Finished difference Result 9855 states and 13904 transitions. [2021-12-18 04:04:11,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-12-18 04:04:11,444 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 7.315789473684211) internal successors, (139), 21 states have internal predecessors, (139), 4 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (19), 2 states have call predecessors, (19), 4 states have call successors, (19) Word has length 221 [2021-12-18 04:04:11,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 04:04:11,462 INFO L225 Difference]: With dead ends: 9855 [2021-12-18 04:04:11,462 INFO L226 Difference]: Without dead ends: 6157 [2021-12-18 04:04:11,470 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 447 GetRequests, 421 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=168, Invalid=588, Unknown=0, NotChecked=0, Total=756 [2021-12-18 04:04:11,471 INFO L933 BasicCegarLoop]: 415 mSDtfsCounter, 406 mSDsluCounter, 4366 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 71 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 442 SdHoareTripleChecker+Valid, 4781 SdHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.9s IncrementalHoareTripleChecker+Time [2021-12-18 04:04:11,471 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [442 Valid, 4781 Invalid, 569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 490 Invalid, 8 Unknown, 0 Unchecked, 17.9s Time] [2021-12-18 04:04:11,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6157 states. [2021-12-18 04:04:11,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6157 to 3937. [2021-12-18 04:04:11,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3937 states, 3056 states have (on average 1.2657068062827226) internal successors, (3868), 3112 states have internal predecessors, (3868), 590 states have call successors, (590), 241 states have call predecessors, (590), 290 states have return successors, (801), 583 states have call predecessors, (801), 589 states have call successors, (801) [2021-12-18 04:04:11,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3937 states to 3937 states and 5259 transitions. [2021-12-18 04:04:11,803 INFO L78 Accepts]: Start accepts. Automaton has 3937 states and 5259 transitions. Word has length 221 [2021-12-18 04:04:11,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 04:04:11,804 INFO L470 AbstractCegarLoop]: Abstraction has 3937 states and 5259 transitions. [2021-12-18 04:04:11,804 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 7.315789473684211) internal successors, (139), 21 states have internal predecessors, (139), 4 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (19), 2 states have call predecessors, (19), 4 states have call successors, (19) [2021-12-18 04:04:11,804 INFO L276 IsEmpty]: Start isEmpty. Operand 3937 states and 5259 transitions. [2021-12-18 04:04:11,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2021-12-18 04:04:11,807 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 04:04:11,808 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 04:04:11,856 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (36)] Ended with exit code 0 [2021-12-18 04:04:12,029 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 04:04:12,030 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 04:04:12,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 04:04:12,030 INFO L85 PathProgramCache]: Analyzing trace with hash -1908486044, now seen corresponding path program 5 times [2021-12-18 04:04:12,031 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 04:04:12,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1890317823] [2021-12-18 04:04:12,031 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-18 04:04:12,031 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 04:04:12,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 04:04:12,032 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 04:04:12,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (37)] Waiting until timeout for monitored process [2021-12-18 04:05:38,779 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2021-12-18 04:05:38,779 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-18 04:05:39,144 INFO L263 TraceCheckSpWp]: Trace formula consists of 2011 conjuncts, 15 conjunts are in the unsatisfiable core [2021-12-18 04:05:39,146 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 04:05:39,619 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 7 proven. 36 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked. [2021-12-18 04:05:39,620 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 04:05:41,749 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 7 proven. 36 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked. [2021-12-18 04:05:41,749 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 04:05:41,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1890317823] [2021-12-18 04:05:41,750 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1890317823] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 04:05:41,750 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-18 04:05:41,750 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 23 [2021-12-18 04:05:41,751 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582080097] [2021-12-18 04:05:41,751 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-18 04:05:41,751 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-12-18 04:05:41,751 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 04:05:41,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-12-18 04:05:41,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=444, Unknown=0, NotChecked=0, Total=506 [2021-12-18 04:05:41,752 INFO L87 Difference]: Start difference. First operand 3937 states and 5259 transitions. Second operand has 23 states, 21 states have (on average 6.714285714285714) internal successors, (141), 23 states have internal predecessors, (141), 4 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (19), 2 states have call predecessors, (19), 4 states have call successors, (19) [2021-12-18 04:05:43,830 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 04:05:45,841 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 04:05:48,236 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 04:05:50,797 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 04:05:53,509 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 04:05:56,198 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 04:05:58,815 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 04:06:01,371 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 04:06:04,059 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 04:06:07,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 04:06:07,458 INFO L93 Difference]: Finished difference Result 9915 states and 14064 transitions. [2021-12-18 04:06:07,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-12-18 04:06:07,460 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 6.714285714285714) internal successors, (141), 23 states have internal predecessors, (141), 4 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (19), 2 states have call predecessors, (19), 4 states have call successors, (19) Word has length 222 [2021-12-18 04:06:07,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 04:06:07,479 INFO L225 Difference]: With dead ends: 9915 [2021-12-18 04:06:07,479 INFO L226 Difference]: Without dead ends: 6207 [2021-12-18 04:06:07,484 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 450 GetRequests, 421 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=152, Invalid=778, Unknown=0, NotChecked=0, Total=930 [2021-12-18 04:06:07,484 INFO L933 BasicCegarLoop]: 415 mSDtfsCounter, 460 mSDsluCounter, 6397 mSDsCounter, 0 mSdLazyCounter, 758 mSolverCounterSat, 96 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 498 SdHoareTripleChecker+Valid, 6812 SdHoareTripleChecker+Invalid, 863 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 758 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.0s IncrementalHoareTripleChecker+Time [2021-12-18 04:06:07,484 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [498 Valid, 6812 Invalid, 863 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 758 Invalid, 9 Unknown, 0 Unchecked, 22.0s Time] [2021-12-18 04:06:07,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6207 states. [2021-12-18 04:06:07,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6207 to 3947. [2021-12-18 04:06:07,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3947 states, 3066 states have (on average 1.2681017612524461) internal successors, (3888), 3122 states have internal predecessors, (3888), 590 states have call successors, (590), 241 states have call predecessors, (590), 290 states have return successors, (801), 583 states have call predecessors, (801), 589 states have call successors, (801) [2021-12-18 04:06:07,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3947 states to 3947 states and 5279 transitions. [2021-12-18 04:06:07,725 INFO L78 Accepts]: Start accepts. Automaton has 3947 states and 5279 transitions. Word has length 222 [2021-12-18 04:06:07,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 04:06:07,726 INFO L470 AbstractCegarLoop]: Abstraction has 3947 states and 5279 transitions. [2021-12-18 04:06:07,726 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 6.714285714285714) internal successors, (141), 23 states have internal predecessors, (141), 4 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (19), 2 states have call predecessors, (19), 4 states have call successors, (19) [2021-12-18 04:06:07,726 INFO L276 IsEmpty]: Start isEmpty. Operand 3947 states and 5279 transitions. [2021-12-18 04:06:07,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2021-12-18 04:06:07,728 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 04:06:07,729 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 04:06:07,815 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (37)] Forceful destruction successful, exit code 0 [2021-12-18 04:06:07,943 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 04:06:07,944 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 04:06:07,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 04:06:07,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1521710861, now seen corresponding path program 3 times [2021-12-18 04:06:07,945 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 04:06:07,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1456266128] [2021-12-18 04:06:07,945 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-18 04:06:07,945 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 04:06:07,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 04:06:07,946 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 04:06:07,948 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (38)] Waiting until timeout for monitored process [2021-12-18 04:06:09,208 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-12-18 04:06:09,208 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-18 04:06:09,246 INFO L263 TraceCheckSpWp]: Trace formula consists of 740 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-18 04:06:09,249 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 04:06:09,664 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 25 proven. 1 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2021-12-18 04:06:09,664 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 04:06:10,226 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 25 proven. 1 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2021-12-18 04:06:10,226 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 04:06:10,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1456266128] [2021-12-18 04:06:10,226 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1456266128] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 04:06:10,226 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-18 04:06:10,227 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2021-12-18 04:06:10,227 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67479288] [2021-12-18 04:06:10,227 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-18 04:06:10,227 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-18 04:06:10,227 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 04:06:10,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-18 04:06:10,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-12-18 04:06:10,228 INFO L87 Difference]: Start difference. First operand 3947 states and 5279 transitions. Second operand has 9 states, 9 states have (on average 15.444444444444445) internal successors, (139), 9 states have internal predecessors, (139), 4 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (21), 2 states have call predecessors, (21), 4 states have call successors, (21) [2021-12-18 04:06:12,282 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 04:06:14,297 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 04:06:14,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 04:06:14,790 INFO L93 Difference]: Finished difference Result 9299 states and 12658 transitions. [2021-12-18 04:06:14,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-18 04:06:14,791 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 15.444444444444445) internal successors, (139), 9 states have internal predecessors, (139), 4 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (21), 2 states have call predecessors, (21), 4 states have call successors, (21) Word has length 236 [2021-12-18 04:06:14,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 04:06:14,815 INFO L225 Difference]: With dead ends: 9299 [2021-12-18 04:06:14,816 INFO L226 Difference]: Without dead ends: 5541 [2021-12-18 04:06:14,821 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 471 GetRequests, 463 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2021-12-18 04:06:14,821 INFO L933 BasicCegarLoop]: 400 mSDtfsCounter, 231 mSDsluCounter, 1060 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 21 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 1460 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2021-12-18 04:06:14,822 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [250 Valid, 1460 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 29 Invalid, 2 Unknown, 0 Unchecked, 4.2s Time] [2021-12-18 04:06:14,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5541 states. [2021-12-18 04:06:15,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5541 to 3947. [2021-12-18 04:06:15,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3947 states, 3066 states have (on average 1.264840182648402) internal successors, (3878), 3122 states have internal predecessors, (3878), 590 states have call successors, (590), 241 states have call predecessors, (590), 290 states have return successors, (801), 583 states have call predecessors, (801), 589 states have call successors, (801) [2021-12-18 04:06:15,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3947 states to 3947 states and 5269 transitions. [2021-12-18 04:06:15,080 INFO L78 Accepts]: Start accepts. Automaton has 3947 states and 5269 transitions. Word has length 236 [2021-12-18 04:06:15,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 04:06:15,081 INFO L470 AbstractCegarLoop]: Abstraction has 3947 states and 5269 transitions. [2021-12-18 04:06:15,081 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 15.444444444444445) internal successors, (139), 9 states have internal predecessors, (139), 4 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (21), 2 states have call predecessors, (21), 4 states have call successors, (21) [2021-12-18 04:06:15,081 INFO L276 IsEmpty]: Start isEmpty. Operand 3947 states and 5269 transitions. [2021-12-18 04:06:15,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2021-12-18 04:06:15,085 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 04:06:15,085 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 04:06:15,110 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (38)] Forceful destruction successful, exit code 0 [2021-12-18 04:06:15,291 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 04:06:15,292 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 04:06:15,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 04:06:15,292 INFO L85 PathProgramCache]: Analyzing trace with hash -619778067, now seen corresponding path program 4 times [2021-12-18 04:06:15,293 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 04:06:15,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [957428733] [2021-12-18 04:06:15,293 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-18 04:06:15,293 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 04:06:15,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 04:06:15,294 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 04:06:15,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (39)] Waiting until timeout for monitored process [2021-12-18 04:06:17,155 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-18 04:06:17,155 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-18 04:06:17,269 INFO L263 TraceCheckSpWp]: Trace formula consists of 1877 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-18 04:06:17,272 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 04:06:17,657 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 31 proven. 3 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2021-12-18 04:06:17,657 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 04:06:18,334 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 31 proven. 3 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2021-12-18 04:06:18,334 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 04:06:18,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [957428733] [2021-12-18 04:06:18,334 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [957428733] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 04:06:18,334 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-18 04:06:18,335 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-12-18 04:06:18,335 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787696828] [2021-12-18 04:06:18,335 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-18 04:06:18,335 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-18 04:06:18,335 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 04:06:18,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-18 04:06:18,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2021-12-18 04:06:18,336 INFO L87 Difference]: Start difference. First operand 3947 states and 5269 transitions. Second operand has 11 states, 11 states have (on average 12.818181818181818) internal successors, (141), 11 states have internal predecessors, (141), 4 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (21), 2 states have call predecessors, (21), 4 states have call successors, (21) [2021-12-18 04:06:20,384 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 04:06:22,397 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 04:06:24,406 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 04:06:24,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 04:06:24,926 INFO L93 Difference]: Finished difference Result 9299 states and 12638 transitions. [2021-12-18 04:06:24,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-18 04:06:24,927 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 12.818181818181818) internal successors, (141), 11 states have internal predecessors, (141), 4 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (21), 2 states have call predecessors, (21), 4 states have call successors, (21) Word has length 237 [2021-12-18 04:06:24,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 04:06:24,939 INFO L225 Difference]: With dead ends: 9299 [2021-12-18 04:06:24,939 INFO L226 Difference]: Without dead ends: 5541 [2021-12-18 04:06:24,946 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 473 GetRequests, 463 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2021-12-18 04:06:24,946 INFO L933 BasicCegarLoop]: 400 mSDtfsCounter, 124 mSDsluCounter, 1724 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 4 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 2124 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2021-12-18 04:06:24,946 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [143 Valid, 2124 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 46 Invalid, 3 Unknown, 0 Unchecked, 6.2s Time] [2021-12-18 04:06:24,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5541 states. [2021-12-18 04:06:25,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5541 to 3947. [2021-12-18 04:06:25,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3947 states, 3066 states have (on average 1.2615786040443575) internal successors, (3868), 3122 states have internal predecessors, (3868), 590 states have call successors, (590), 241 states have call predecessors, (590), 290 states have return successors, (801), 583 states have call predecessors, (801), 589 states have call successors, (801) [2021-12-18 04:06:25,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3947 states to 3947 states and 5259 transitions. [2021-12-18 04:06:25,252 INFO L78 Accepts]: Start accepts. Automaton has 3947 states and 5259 transitions. Word has length 237 [2021-12-18 04:06:25,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 04:06:25,252 INFO L470 AbstractCegarLoop]: Abstraction has 3947 states and 5259 transitions. [2021-12-18 04:06:25,252 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.818181818181818) internal successors, (141), 11 states have internal predecessors, (141), 4 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (21), 2 states have call predecessors, (21), 4 states have call successors, (21) [2021-12-18 04:06:25,253 INFO L276 IsEmpty]: Start isEmpty. Operand 3947 states and 5259 transitions. [2021-12-18 04:06:25,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2021-12-18 04:06:25,255 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 04:06:25,255 INFO L514 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 04:06:25,301 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (39)] Forceful destruction successful, exit code 0 [2021-12-18 04:06:25,460 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 04:06:25,461 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 04:06:25,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 04:06:25,461 INFO L85 PathProgramCache]: Analyzing trace with hash -2010197746, now seen corresponding path program 6 times [2021-12-18 04:06:25,462 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 04:06:25,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2023879672] [2021-12-18 04:06:25,462 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-12-18 04:06:25,462 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 04:06:25,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 04:06:25,463 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 04:06:25,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (40)] Waiting until timeout for monitored process [2021-12-18 04:07:30,983 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2021-12-18 04:07:30,983 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-18 04:07:31,268 INFO L263 TraceCheckSpWp]: Trace formula consists of 2140 conjuncts, 16 conjunts are in the unsatisfiable core [2021-12-18 04:07:31,270 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 04:07:31,906 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 7 proven. 45 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked. [2021-12-18 04:07:31,907 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 04:07:34,237 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 7 proven. 45 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked. [2021-12-18 04:07:34,237 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 04:07:34,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2023879672] [2021-12-18 04:07:34,237 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2023879672] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 04:07:34,237 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-18 04:07:34,237 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 25 [2021-12-18 04:07:34,237 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988459607] [2021-12-18 04:07:34,237 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-18 04:07:34,238 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-12-18 04:07:34,238 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 04:07:34,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-12-18 04:07:34,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=532, Unknown=0, NotChecked=0, Total=600 [2021-12-18 04:07:34,238 INFO L87 Difference]: Start difference. First operand 3947 states and 5259 transitions. Second operand has 25 states, 23 states have (on average 6.217391304347826) internal successors, (143), 25 states have internal predecessors, (143), 4 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (19), 2 states have call predecessors, (19), 4 states have call successors, (19) [2021-12-18 04:07:36,317 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 04:07:38,326 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 04:07:40,337 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 04:07:42,349 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 04:07:44,911 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 04:07:47,583 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 04:07:50,085 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 04:07:52,766 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 04:07:55,467 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 04:07:58,045 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 04:08:01,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 04:08:01,683 INFO L93 Difference]: Finished difference Result 9895 states and 14024 transitions. [2021-12-18 04:08:01,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-12-18 04:08:01,686 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 6.217391304347826) internal successors, (143), 25 states have internal predecessors, (143), 4 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (19), 2 states have call predecessors, (19), 4 states have call successors, (19) Word has length 223 [2021-12-18 04:08:01,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 04:08:01,699 INFO L225 Difference]: With dead ends: 9895 [2021-12-18 04:08:01,699 INFO L226 Difference]: Without dead ends: 6177 [2021-12-18 04:08:01,705 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 451 GetRequests, 421 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=154, Invalid=838, Unknown=0, NotChecked=0, Total=992 [2021-12-18 04:08:01,705 INFO L933 BasicCegarLoop]: 414 mSDtfsCounter, 341 mSDsluCounter, 6261 mSDsCounter, 0 mSdLazyCounter, 738 mSolverCounterSat, 58 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 6675 SdHoareTripleChecker+Invalid, 806 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 738 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.1s IncrementalHoareTripleChecker+Time [2021-12-18 04:08:01,706 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [379 Valid, 6675 Invalid, 806 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 738 Invalid, 10 Unknown, 0 Unchecked, 24.1s Time] [2021-12-18 04:08:01,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6177 states. [2021-12-18 04:08:01,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6177 to 3957. [2021-12-18 04:08:01,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3957 states, 3076 states have (on average 1.2639791937581275) internal successors, (3888), 3132 states have internal predecessors, (3888), 590 states have call successors, (590), 241 states have call predecessors, (590), 290 states have return successors, (801), 583 states have call predecessors, (801), 589 states have call successors, (801) [2021-12-18 04:08:01,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3957 states to 3957 states and 5279 transitions. [2021-12-18 04:08:01,986 INFO L78 Accepts]: Start accepts. Automaton has 3957 states and 5279 transitions. Word has length 223 [2021-12-18 04:08:01,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 04:08:01,986 INFO L470 AbstractCegarLoop]: Abstraction has 3957 states and 5279 transitions. [2021-12-18 04:08:01,987 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 6.217391304347826) internal successors, (143), 25 states have internal predecessors, (143), 4 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (19), 2 states have call predecessors, (19), 4 states have call successors, (19) [2021-12-18 04:08:01,987 INFO L276 IsEmpty]: Start isEmpty. Operand 3957 states and 5279 transitions. [2021-12-18 04:08:01,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2021-12-18 04:08:01,989 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 04:08:01,989 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 04:08:02,096 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (40)] Forceful destruction successful, exit code 0 [2021-12-18 04:08:02,197 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 04:08:02,197 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 04:08:02,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 04:08:02,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1713541901, now seen corresponding path program 5 times [2021-12-18 04:08:02,201 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 04:08:02,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [537613333] [2021-12-18 04:08:02,201 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-18 04:08:02,201 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 04:08:02,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 04:08:02,202 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 04:08:02,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (41)] Waiting until timeout for monitored process Killed by 15