./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../../sv-benchmarks/c/heap-manipulation/dll_of_dll-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version e943c265 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397c4bc2-793d-47a2-8c40-75596478889c/bin/utaipan-9zjyvhn0QE/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397c4bc2-793d-47a2-8c40-75596478889c/bin/utaipan-9zjyvhn0QE/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397c4bc2-793d-47a2-8c40-75596478889c/bin/utaipan-9zjyvhn0QE/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397c4bc2-793d-47a2-8c40-75596478889c/bin/utaipan-9zjyvhn0QE/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/heap-manipulation/dll_of_dll-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397c4bc2-793d-47a2-8c40-75596478889c/bin/utaipan-9zjyvhn0QE/config/svcomp-MemCleanup-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397c4bc2-793d-47a2-8c40-75596478889c/bin/utaipan-9zjyvhn0QE --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0eca46c14885d62179341dcc13b398752af03e020a80dcf533f4c9afc7372707 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-e943c26 [2021-10-24 11:00:35,423 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-24 11:00:35,426 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-24 11:00:35,484 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-24 11:00:35,484 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-24 11:00:35,486 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-24 11:00:35,487 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-24 11:00:35,490 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-24 11:00:35,492 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-24 11:00:35,493 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-24 11:00:35,495 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-24 11:00:35,496 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-24 11:00:35,497 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-24 11:00:35,498 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-24 11:00:35,500 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-24 11:00:35,501 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-24 11:00:35,502 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-24 11:00:35,504 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-24 11:00:35,506 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-24 11:00:35,509 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-24 11:00:35,511 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-24 11:00:35,513 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-24 11:00:35,514 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-24 11:00:35,516 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-24 11:00:35,520 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-24 11:00:35,520 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-24 11:00:35,521 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-24 11:00:35,530 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-24 11:00:35,531 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-24 11:00:35,532 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-24 11:00:35,532 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-24 11:00:35,535 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-24 11:00:35,536 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-24 11:00:35,538 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-24 11:00:35,539 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-24 11:00:35,544 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-24 11:00:35,545 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-24 11:00:35,545 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-24 11:00:35,545 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-24 11:00:35,547 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-24 11:00:35,548 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-24 11:00:35,549 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397c4bc2-793d-47a2-8c40-75596478889c/bin/utaipan-9zjyvhn0QE/config/svcomp-MemCleanup-32bit-Taipan_Default.epf [2021-10-24 11:00:35,575 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-24 11:00:35,575 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-24 11:00:35,576 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-10-24 11:00:35,577 INFO L138 SettingsManager]: * User list type=DISABLED [2021-10-24 11:00:35,577 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-10-24 11:00:35,577 INFO L138 SettingsManager]: * Explicit value domain=true [2021-10-24 11:00:35,577 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-10-24 11:00:35,578 INFO L138 SettingsManager]: * Octagon Domain=false [2021-10-24 11:00:35,578 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-10-24 11:00:35,578 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-10-24 11:00:35,578 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-10-24 11:00:35,579 INFO L138 SettingsManager]: * Interval Domain=false [2021-10-24 11:00:35,579 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-10-24 11:00:35,579 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-10-24 11:00:35,579 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-10-24 11:00:35,580 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-24 11:00:35,580 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-24 11:00:35,581 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-24 11:00:35,581 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-24 11:00:35,581 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-10-24 11:00:35,581 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-24 11:00:35,582 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-24 11:00:35,582 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-24 11:00:35,582 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-10-24 11:00:35,582 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-10-24 11:00:35,583 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-24 11:00:35,583 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-10-24 11:00:35,583 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-24 11:00:35,583 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-24 11:00:35,584 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-24 11:00:35,584 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-24 11:00:35,584 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-24 11:00:35,585 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-24 11:00:35,585 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-24 11:00:35,585 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-10-24 11:00:35,585 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-24 11:00:35,586 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-24 11:00:35,586 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-10-24 11:00:35,586 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397c4bc2-793d-47a2-8c40-75596478889c/bin/utaipan-9zjyvhn0QE/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397c4bc2-793d-47a2-8c40-75596478889c/bin/utaipan-9zjyvhn0QE 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 valid-memcleanup) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0eca46c14885d62179341dcc13b398752af03e020a80dcf533f4c9afc7372707 [2021-10-24 11:00:35,850 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-24 11:00:35,874 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-24 11:00:35,877 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-24 11:00:35,878 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-24 11:00:35,879 INFO L275 PluginConnector]: CDTParser initialized [2021-10-24 11:00:35,880 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397c4bc2-793d-47a2-8c40-75596478889c/bin/utaipan-9zjyvhn0QE/../../sv-benchmarks/c/heap-manipulation/dll_of_dll-2.i [2021-10-24 11:00:35,946 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397c4bc2-793d-47a2-8c40-75596478889c/bin/utaipan-9zjyvhn0QE/data/60fdfb98d/d872980a9bd74ee792172ff1f548b2d6/FLAG17ca2d6b9 [2021-10-24 11:00:36,534 INFO L306 CDTParser]: Found 1 translation units. [2021-10-24 11:00:36,534 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397c4bc2-793d-47a2-8c40-75596478889c/sv-benchmarks/c/heap-manipulation/dll_of_dll-2.i [2021-10-24 11:00:36,548 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397c4bc2-793d-47a2-8c40-75596478889c/bin/utaipan-9zjyvhn0QE/data/60fdfb98d/d872980a9bd74ee792172ff1f548b2d6/FLAG17ca2d6b9 [2021-10-24 11:00:36,773 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397c4bc2-793d-47a2-8c40-75596478889c/bin/utaipan-9zjyvhn0QE/data/60fdfb98d/d872980a9bd74ee792172ff1f548b2d6 [2021-10-24 11:00:36,777 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-24 11:00:36,778 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-24 11:00:36,780 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-24 11:00:36,780 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-24 11:00:36,784 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-24 11:00:36,785 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:00:36" (1/1) ... [2021-10-24 11:00:36,787 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3996487f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:00:36, skipping insertion in model container [2021-10-24 11:00:36,788 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:00:36" (1/1) ... [2021-10-24 11:00:36,796 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-24 11:00:36,864 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-24 11:00:37,215 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397c4bc2-793d-47a2-8c40-75596478889c/sv-benchmarks/c/heap-manipulation/dll_of_dll-2.i[22634,22647] [2021-10-24 11:00:37,296 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-24 11:00:37,308 INFO L203 MainTranslator]: Completed pre-run [2021-10-24 11:00:37,356 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397c4bc2-793d-47a2-8c40-75596478889c/sv-benchmarks/c/heap-manipulation/dll_of_dll-2.i[22634,22647] [2021-10-24 11:00:37,381 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-24 11:00:37,416 INFO L208 MainTranslator]: Completed translation [2021-10-24 11:00:37,416 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:00:37 WrapperNode [2021-10-24 11:00:37,417 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-24 11:00:37,418 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-24 11:00:37,418 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-24 11:00:37,418 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-24 11:00:37,426 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:00:37" (1/1) ... [2021-10-24 11:00:37,461 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:00:37" (1/1) ... [2021-10-24 11:00:37,525 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-24 11:00:37,528 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-24 11:00:37,528 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-24 11:00:37,529 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-24 11:00:37,536 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:00:37" (1/1) ... [2021-10-24 11:00:37,536 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:00:37" (1/1) ... [2021-10-24 11:00:37,544 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:00:37" (1/1) ... [2021-10-24 11:00:37,545 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:00:37" (1/1) ... [2021-10-24 11:00:37,562 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:00:37" (1/1) ... [2021-10-24 11:00:37,574 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:00:37" (1/1) ... [2021-10-24 11:00:37,577 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:00:37" (1/1) ... [2021-10-24 11:00:37,583 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-24 11:00:37,584 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-24 11:00:37,584 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-24 11:00:37,584 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-24 11:00:37,585 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:00:37" (1/1) ... [2021-10-24 11:00:37,593 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-24 11:00:37,605 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397c4bc2-793d-47a2-8c40-75596478889c/bin/utaipan-9zjyvhn0QE/z3 [2021-10-24 11:00:37,625 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397c4bc2-793d-47a2-8c40-75596478889c/bin/utaipan-9zjyvhn0QE/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-24 11:00:37,629 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397c4bc2-793d-47a2-8c40-75596478889c/bin/utaipan-9zjyvhn0QE/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-24 11:00:37,662 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-10-24 11:00:37,662 INFO L130 BoogieDeclarations]: Found specification of procedure dll_insert_master [2021-10-24 11:00:37,662 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_insert_master [2021-10-24 11:00:37,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-10-24 11:00:37,662 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-24 11:00:37,663 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2021-10-24 11:00:37,663 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2021-10-24 11:00:37,663 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-10-24 11:00:37,663 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-10-24 11:00:37,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-10-24 11:00:37,663 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create_generic [2021-10-24 11:00:37,664 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create_generic [2021-10-24 11:00:37,664 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create_slave [2021-10-24 11:00:37,664 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create_slave [2021-10-24 11:00:37,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-24 11:00:37,664 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-24 11:00:37,665 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-24 11:00:39,003 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-24 11:00:39,003 INFO L299 CfgBuilder]: Removed 148 assume(true) statements. [2021-10-24 11:00:39,007 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:00:39 BoogieIcfgContainer [2021-10-24 11:00:39,007 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-24 11:00:39,009 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-24 11:00:39,009 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-24 11:00:39,014 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-24 11:00:39,014 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:00:36" (1/3) ... [2021-10-24 11:00:39,015 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@da364e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:00:39, skipping insertion in model container [2021-10-24 11:00:39,015 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:00:37" (2/3) ... [2021-10-24 11:00:39,016 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@da364e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:00:39, skipping insertion in model container [2021-10-24 11:00:39,016 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:00:39" (3/3) ... [2021-10-24 11:00:39,018 INFO L111 eAbstractionObserver]: Analyzing ICFG dll_of_dll-2.i [2021-10-24 11:00:39,025 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-24 11:00:39,025 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 159 error locations. [2021-10-24 11:00:39,080 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-24 11:00:39,087 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=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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-10-24 11:00:39,087 INFO L340 AbstractCegarLoop]: Starting to check reachability of 159 error locations. [2021-10-24 11:00:39,113 INFO L276 IsEmpty]: Start isEmpty. Operand has 342 states, 171 states have (on average 2.47953216374269) internal successors, (424), 332 states have internal predecessors, (424), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2021-10-24 11:00:39,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-10-24 11:00:39,121 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 11:00:39,121 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-10-24 11:00:39,122 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ##fun~$Pointer$~TO~VOIDErr0REQUIRES_VIOLATION === [##fun~$Pointer$~TO~VOIDErr0REQUIRES_VIOLATION, ##fun~$Pointer$~TO~VOIDErr1REQUIRES_VIOLATION, ##fun~$Pointer$~TO~VOIDErr2REQUIRES_VIOLATION (and 156 more)] === [2021-10-24 11:00:39,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 11:00:39,128 INFO L82 PathProgramCache]: Analyzing trace with hash 1934548942, now seen corresponding path program 1 times [2021-10-24 11:00:39,139 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 11:00:39,139 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747394076] [2021-10-24 11:00:39,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 11:00:39,141 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 11:00:39,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 11:00:39,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-24 11:00:39,362 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 11:00:39,362 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747394076] [2021-10-24 11:00:39,363 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747394076] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-24 11:00:39,364 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-24 11:00:39,365 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-24 11:00:39,376 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913869919] [2021-10-24 11:00:39,383 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-24 11:00:39,383 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 11:00:39,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-24 11:00:39,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-24 11:00:39,414 INFO L87 Difference]: Start difference. First operand has 342 states, 171 states have (on average 2.47953216374269) internal successors, (424), 332 states have internal predecessors, (424), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 11:00:39,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 11:00:39,778 INFO L93 Difference]: Finished difference Result 342 states and 361 transitions. [2021-10-24 11:00:39,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-24 11:00:39,780 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-10-24 11:00:39,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 11:00:39,806 INFO L225 Difference]: With dead ends: 342 [2021-10-24 11:00:39,807 INFO L226 Difference]: Without dead ends: 341 [2021-10-24 11:00:39,809 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-24 11:00:39,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2021-10-24 11:00:39,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 339. [2021-10-24 11:00:39,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 171 states have (on average 2.0) internal successors, (342), 329 states have internal predecessors, (342), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2021-10-24 11:00:39,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 356 transitions. [2021-10-24 11:00:39,898 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 356 transitions. Word has length 7 [2021-10-24 11:00:39,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 11:00:39,899 INFO L470 AbstractCegarLoop]: Abstraction has 339 states and 356 transitions. [2021-10-24 11:00:39,899 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 11:00:39,900 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 356 transitions. [2021-10-24 11:00:39,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-10-24 11:00:39,900 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 11:00:39,901 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-10-24 11:00:39,901 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-24 11:00:39,901 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ##fun~$Pointer$~TO~VOIDErr1REQUIRES_VIOLATION === [##fun~$Pointer$~TO~VOIDErr0REQUIRES_VIOLATION, ##fun~$Pointer$~TO~VOIDErr1REQUIRES_VIOLATION, ##fun~$Pointer$~TO~VOIDErr2REQUIRES_VIOLATION (and 156 more)] === [2021-10-24 11:00:39,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 11:00:39,902 INFO L82 PathProgramCache]: Analyzing trace with hash 1934548943, now seen corresponding path program 1 times [2021-10-24 11:00:39,902 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 11:00:39,903 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053233034] [2021-10-24 11:00:39,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 11:00:39,903 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 11:00:39,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 11:00:39,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-24 11:00:39,984 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 11:00:39,984 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053233034] [2021-10-24 11:00:39,984 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053233034] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-24 11:00:39,984 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-24 11:00:39,985 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-24 11:00:39,985 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375316294] [2021-10-24 11:00:39,986 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-24 11:00:39,986 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 11:00:39,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-24 11:00:39,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-24 11:00:39,988 INFO L87 Difference]: Start difference. First operand 339 states and 356 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 11:00:40,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 11:00:40,222 INFO L93 Difference]: Finished difference Result 339 states and 358 transitions. [2021-10-24 11:00:40,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-24 11:00:40,223 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-10-24 11:00:40,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 11:00:40,227 INFO L225 Difference]: With dead ends: 339 [2021-10-24 11:00:40,228 INFO L226 Difference]: Without dead ends: 339 [2021-10-24 11:00:40,229 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-24 11:00:40,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2021-10-24 11:00:40,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 337. [2021-10-24 11:00:40,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 171 states have (on average 1.9883040935672514) internal successors, (340), 327 states have internal predecessors, (340), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2021-10-24 11:00:40,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 354 transitions. [2021-10-24 11:00:40,275 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 354 transitions. Word has length 7 [2021-10-24 11:00:40,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 11:00:40,275 INFO L470 AbstractCegarLoop]: Abstraction has 337 states and 354 transitions. [2021-10-24 11:00:40,276 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 11:00:40,276 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 354 transitions. [2021-10-24 11:00:40,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-10-24 11:00:40,276 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 11:00:40,277 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-24 11:00:40,277 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-24 11:00:40,277 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting dll_insert_masterErr0REQUIRES_VIOLATION === [##fun~$Pointer$~TO~VOIDErr0REQUIRES_VIOLATION, ##fun~$Pointer$~TO~VOIDErr1REQUIRES_VIOLATION, ##fun~$Pointer$~TO~VOIDErr2REQUIRES_VIOLATION (and 156 more)] === [2021-10-24 11:00:40,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 11:00:40,278 INFO L82 PathProgramCache]: Analyzing trace with hash -647647508, now seen corresponding path program 1 times [2021-10-24 11:00:40,278 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 11:00:40,278 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423443867] [2021-10-24 11:00:40,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 11:00:40,279 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 11:00:40,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 11:00:40,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-24 11:00:40,387 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 11:00:40,387 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423443867] [2021-10-24 11:00:40,387 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423443867] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-24 11:00:40,387 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-24 11:00:40,387 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-24 11:00:40,388 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707875937] [2021-10-24 11:00:40,388 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-24 11:00:40,388 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 11:00:40,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-24 11:00:40,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-24 11:00:40,390 INFO L87 Difference]: Start difference. First operand 337 states and 354 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 11:00:40,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 11:00:40,598 INFO L93 Difference]: Finished difference Result 334 states and 351 transitions. [2021-10-24 11:00:40,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-24 11:00:40,598 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-10-24 11:00:40,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 11:00:40,601 INFO L225 Difference]: With dead ends: 334 [2021-10-24 11:00:40,602 INFO L226 Difference]: Without dead ends: 334 [2021-10-24 11:00:40,602 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-24 11:00:40,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2021-10-24 11:00:40,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 334. [2021-10-24 11:00:40,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 171 states have (on average 1.9707602339181287) internal successors, (337), 324 states have internal predecessors, (337), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2021-10-24 11:00:40,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 351 transitions. [2021-10-24 11:00:40,621 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 351 transitions. Word has length 9 [2021-10-24 11:00:40,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 11:00:40,621 INFO L470 AbstractCegarLoop]: Abstraction has 334 states and 351 transitions. [2021-10-24 11:00:40,622 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 11:00:40,622 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 351 transitions. [2021-10-24 11:00:40,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-10-24 11:00:40,623 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 11:00:40,623 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-24 11:00:40,624 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-24 11:00:40,624 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting dll_insert_masterErr1REQUIRES_VIOLATION === [##fun~$Pointer$~TO~VOIDErr0REQUIRES_VIOLATION, ##fun~$Pointer$~TO~VOIDErr1REQUIRES_VIOLATION, ##fun~$Pointer$~TO~VOIDErr2REQUIRES_VIOLATION (and 156 more)] === [2021-10-24 11:00:40,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 11:00:40,625 INFO L82 PathProgramCache]: Analyzing trace with hash -647647507, now seen corresponding path program 1 times [2021-10-24 11:00:40,625 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 11:00:40,626 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675100054] [2021-10-24 11:00:40,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 11:00:40,626 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 11:00:40,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 11:00:40,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-24 11:00:40,727 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 11:00:40,727 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675100054] [2021-10-24 11:00:40,730 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675100054] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-24 11:00:40,731 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-24 11:00:40,731 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-24 11:00:40,732 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128526982] [2021-10-24 11:00:40,732 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-24 11:00:40,733 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 11:00:40,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-24 11:00:40,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-24 11:00:40,734 INFO L87 Difference]: Start difference. First operand 334 states and 351 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 11:00:40,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 11:00:40,901 INFO L93 Difference]: Finished difference Result 331 states and 348 transitions. [2021-10-24 11:00:40,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-24 11:00:40,902 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-10-24 11:00:40,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 11:00:40,906 INFO L225 Difference]: With dead ends: 331 [2021-10-24 11:00:40,906 INFO L226 Difference]: Without dead ends: 331 [2021-10-24 11:00:40,908 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-24 11:00:40,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2021-10-24 11:00:40,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 331. [2021-10-24 11:00:40,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 171 states have (on average 1.9532163742690059) internal successors, (334), 321 states have internal predecessors, (334), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2021-10-24 11:00:40,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 348 transitions. [2021-10-24 11:00:40,920 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 348 transitions. Word has length 9 [2021-10-24 11:00:40,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 11:00:40,921 INFO L470 AbstractCegarLoop]: Abstraction has 331 states and 348 transitions. [2021-10-24 11:00:40,921 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 11:00:40,921 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 348 transitions. [2021-10-24 11:00:40,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-10-24 11:00:40,922 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 11:00:40,922 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-24 11:00:40,922 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-24 11:00:40,923 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ##fun~$Pointer$~TO~VOIDErr4REQUIRES_VIOLATION === [##fun~$Pointer$~TO~VOIDErr0REQUIRES_VIOLATION, ##fun~$Pointer$~TO~VOIDErr1REQUIRES_VIOLATION, ##fun~$Pointer$~TO~VOIDErr2REQUIRES_VIOLATION (and 156 more)] === [2021-10-24 11:00:40,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 11:00:40,923 INFO L82 PathProgramCache]: Analyzing trace with hash -619277081, now seen corresponding path program 1 times [2021-10-24 11:00:40,924 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 11:00:40,924 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43525694] [2021-10-24 11:00:40,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 11:00:40,925 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 11:00:40,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 11:00:41,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-24 11:00:41,102 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 11:00:41,102 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43525694] [2021-10-24 11:00:41,102 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43525694] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-24 11:00:41,102 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-24 11:00:41,102 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-24 11:00:41,103 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534353076] [2021-10-24 11:00:41,104 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-24 11:00:41,105 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 11:00:41,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-24 11:00:41,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-24 11:00:41,106 INFO L87 Difference]: Start difference. First operand 331 states and 348 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 11:00:41,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 11:00:41,211 INFO L93 Difference]: Finished difference Result 353 states and 378 transitions. [2021-10-24 11:00:41,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-24 11:00:41,212 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-10-24 11:00:41,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 11:00:41,215 INFO L225 Difference]: With dead ends: 353 [2021-10-24 11:00:41,215 INFO L226 Difference]: Without dead ends: 353 [2021-10-24 11:00:41,216 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 68.7ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-10-24 11:00:41,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2021-10-24 11:00:41,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 347. [2021-10-24 11:00:41,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 180 states have (on average 1.9277777777777778) internal successors, (347), 330 states have internal predecessors, (347), 12 states have call successors, (12), 6 states have call predecessors, (12), 6 states have return successors, (15), 10 states have call predecessors, (15), 12 states have call successors, (15) [2021-10-24 11:00:41,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 374 transitions. [2021-10-24 11:00:41,231 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 374 transitions. Word has length 9 [2021-10-24 11:00:41,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 11:00:41,231 INFO L470 AbstractCegarLoop]: Abstraction has 347 states and 374 transitions. [2021-10-24 11:00:41,232 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 11:00:41,232 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 374 transitions. [2021-10-24 11:00:41,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-10-24 11:00:41,236 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 11:00:41,236 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-24 11:00:41,236 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-24 11:00:41,237 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting dll_insert_masterErr6REQUIRES_VIOLATION === [##fun~$Pointer$~TO~VOIDErr0REQUIRES_VIOLATION, ##fun~$Pointer$~TO~VOIDErr1REQUIRES_VIOLATION, ##fun~$Pointer$~TO~VOIDErr2REQUIRES_VIOLATION (and 156 more)] === [2021-10-24 11:00:41,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 11:00:41,238 INFO L82 PathProgramCache]: Analyzing trace with hash -1073762538, now seen corresponding path program 1 times [2021-10-24 11:00:41,238 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 11:00:41,238 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094841056] [2021-10-24 11:00:41,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 11:00:41,244 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 11:00:41,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 11:00:41,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-24 11:00:41,369 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 11:00:41,370 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094841056] [2021-10-24 11:00:41,370 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094841056] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-24 11:00:41,370 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-24 11:00:41,370 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-24 11:00:41,370 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185018417] [2021-10-24 11:00:41,371 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-24 11:00:41,371 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 11:00:41,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-24 11:00:41,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-10-24 11:00:41,372 INFO L87 Difference]: Start difference. First operand 347 states and 374 transitions. Second operand has 8 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 11:00:41,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 11:00:41,955 INFO L93 Difference]: Finished difference Result 366 states and 396 transitions. [2021-10-24 11:00:41,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-24 11:00:41,955 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-10-24 11:00:41,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 11:00:41,958 INFO L225 Difference]: With dead ends: 366 [2021-10-24 11:00:41,958 INFO L226 Difference]: Without dead ends: 366 [2021-10-24 11:00:41,958 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 44.3ms TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-10-24 11:00:41,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2021-10-24 11:00:41,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 356. [2021-10-24 11:00:41,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 188 states have (on average 1.898936170212766) internal successors, (357), 337 states have internal predecessors, (357), 13 states have call successors, (13), 8 states have call predecessors, (13), 6 states have return successors, (16), 10 states have call predecessors, (16), 13 states have call successors, (16) [2021-10-24 11:00:41,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 386 transitions. [2021-10-24 11:00:41,970 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 386 transitions. Word has length 12 [2021-10-24 11:00:41,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 11:00:41,971 INFO L470 AbstractCegarLoop]: Abstraction has 356 states and 386 transitions. [2021-10-24 11:00:41,971 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 11:00:41,971 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 386 transitions. [2021-10-24 11:00:41,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-10-24 11:00:41,971 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 11:00:41,972 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-24 11:00:41,972 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-24 11:00:41,972 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting dll_insert_masterErr7REQUIRES_VIOLATION === [##fun~$Pointer$~TO~VOIDErr0REQUIRES_VIOLATION, ##fun~$Pointer$~TO~VOIDErr1REQUIRES_VIOLATION, ##fun~$Pointer$~TO~VOIDErr2REQUIRES_VIOLATION (and 156 more)] === [2021-10-24 11:00:41,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 11:00:41,972 INFO L82 PathProgramCache]: Analyzing trace with hash -1073762537, now seen corresponding path program 1 times [2021-10-24 11:00:41,973 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 11:00:41,973 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376320886] [2021-10-24 11:00:41,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 11:00:41,973 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 11:00:41,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 11:00:42,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-24 11:00:42,080 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 11:00:42,080 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376320886] [2021-10-24 11:00:42,081 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376320886] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-24 11:00:42,081 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-24 11:00:42,081 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-24 11:00:42,081 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718556470] [2021-10-24 11:00:42,082 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-24 11:00:42,082 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 11:00:42,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-24 11:00:42,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-10-24 11:00:42,083 INFO L87 Difference]: Start difference. First operand 356 states and 386 transitions. Second operand has 7 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 11:00:42,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 11:00:42,741 INFO L93 Difference]: Finished difference Result 364 states and 394 transitions. [2021-10-24 11:00:42,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-24 11:00:42,742 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-10-24 11:00:42,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 11:00:42,745 INFO L225 Difference]: With dead ends: 364 [2021-10-24 11:00:42,745 INFO L226 Difference]: Without dead ends: 364 [2021-10-24 11:00:42,745 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 55.2ms TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-10-24 11:00:42,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2021-10-24 11:00:42,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 356. [2021-10-24 11:00:42,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 188 states have (on average 1.8882978723404256) internal successors, (355), 337 states have internal predecessors, (355), 13 states have call successors, (13), 8 states have call predecessors, (13), 6 states have return successors, (16), 10 states have call predecessors, (16), 13 states have call successors, (16) [2021-10-24 11:00:42,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 384 transitions. [2021-10-24 11:00:42,757 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 384 transitions. Word has length 12 [2021-10-24 11:00:42,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 11:00:42,758 INFO L470 AbstractCegarLoop]: Abstraction has 356 states and 384 transitions. [2021-10-24 11:00:42,758 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 11:00:42,758 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 384 transitions. [2021-10-24 11:00:42,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-10-24 11:00:42,759 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 11:00:42,759 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-24 11:00:42,759 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-24 11:00:42,759 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting dll_insert_masterErr8REQUIRES_VIOLATION === [##fun~$Pointer$~TO~VOIDErr0REQUIRES_VIOLATION, ##fun~$Pointer$~TO~VOIDErr1REQUIRES_VIOLATION, ##fun~$Pointer$~TO~VOIDErr2REQUIRES_VIOLATION (and 156 more)] === [2021-10-24 11:00:42,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 11:00:42,760 INFO L82 PathProgramCache]: Analyzing trace with hash 1073127878, now seen corresponding path program 1 times [2021-10-24 11:00:42,760 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 11:00:42,760 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337660314] [2021-10-24 11:00:42,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 11:00:42,761 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 11:00:42,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 11:00:42,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-24 11:00:42,790 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 11:00:42,790 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337660314] [2021-10-24 11:00:42,791 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337660314] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-24 11:00:42,791 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-24 11:00:42,791 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-24 11:00:42,791 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441438606] [2021-10-24 11:00:42,791 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-24 11:00:42,792 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 11:00:42,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-24 11:00:42,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-24 11:00:42,793 INFO L87 Difference]: Start difference. First operand 356 states and 384 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 11:00:42,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 11:00:42,988 INFO L93 Difference]: Finished difference Result 355 states and 383 transitions. [2021-10-24 11:00:42,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-24 11:00:42,989 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-10-24 11:00:42,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 11:00:42,991 INFO L225 Difference]: With dead ends: 355 [2021-10-24 11:00:42,991 INFO L226 Difference]: Without dead ends: 355 [2021-10-24 11:00:42,992 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.1ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-24 11:00:42,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2021-10-24 11:00:43,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 355. [2021-10-24 11:00:43,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 188 states have (on average 1.8829787234042554) internal successors, (354), 336 states have internal predecessors, (354), 13 states have call successors, (13), 8 states have call predecessors, (13), 6 states have return successors, (16), 10 states have call predecessors, (16), 13 states have call successors, (16) [2021-10-24 11:00:43,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 383 transitions. [2021-10-24 11:00:43,003 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 383 transitions. Word has length 13 [2021-10-24 11:00:43,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 11:00:43,003 INFO L470 AbstractCegarLoop]: Abstraction has 355 states and 383 transitions. [2021-10-24 11:00:43,003 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 11:00:43,004 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 383 transitions. [2021-10-24 11:00:43,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-10-24 11:00:43,004 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 11:00:43,004 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-24 11:00:43,004 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-24 11:00:43,004 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting dll_insert_masterErr9REQUIRES_VIOLATION === [##fun~$Pointer$~TO~VOIDErr0REQUIRES_VIOLATION, ##fun~$Pointer$~TO~VOIDErr1REQUIRES_VIOLATION, ##fun~$Pointer$~TO~VOIDErr2REQUIRES_VIOLATION (and 156 more)] === [2021-10-24 11:00:43,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 11:00:43,005 INFO L82 PathProgramCache]: Analyzing trace with hash 1073127879, now seen corresponding path program 1 times [2021-10-24 11:00:43,005 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 11:00:43,005 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779663398] [2021-10-24 11:00:43,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 11:00:43,006 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 11:00:43,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 11:00:43,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-24 11:00:43,098 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 11:00:43,100 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779663398] [2021-10-24 11:00:43,100 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779663398] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-24 11:00:43,101 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-24 11:00:43,101 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-24 11:00:43,101 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910366093] [2021-10-24 11:00:43,102 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-24 11:00:43,102 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 11:00:43,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-24 11:00:43,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-24 11:00:43,104 INFO L87 Difference]: Start difference. First operand 355 states and 383 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 11:00:43,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 11:00:43,293 INFO L93 Difference]: Finished difference Result 354 states and 382 transitions. [2021-10-24 11:00:43,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-24 11:00:43,294 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-10-24 11:00:43,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 11:00:43,296 INFO L225 Difference]: With dead ends: 354 [2021-10-24 11:00:43,297 INFO L226 Difference]: Without dead ends: 354 [2021-10-24 11:00:43,297 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 20.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-24 11:00:43,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2021-10-24 11:00:43,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 354. [2021-10-24 11:00:43,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 188 states have (on average 1.877659574468085) internal successors, (353), 335 states have internal predecessors, (353), 13 states have call successors, (13), 8 states have call predecessors, (13), 6 states have return successors, (16), 10 states have call predecessors, (16), 13 states have call successors, (16) [2021-10-24 11:00:43,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 382 transitions. [2021-10-24 11:00:43,309 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 382 transitions. Word has length 13 [2021-10-24 11:00:43,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 11:00:43,310 INFO L470 AbstractCegarLoop]: Abstraction has 354 states and 382 transitions. [2021-10-24 11:00:43,310 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 11:00:43,310 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 382 transitions. [2021-10-24 11:00:43,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-10-24 11:00:43,311 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 11:00:43,311 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-24 11:00:43,311 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-24 11:00:43,311 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting dll_insert_masterErr10REQUIRES_VIOLATION === [##fun~$Pointer$~TO~VOIDErr0REQUIRES_VIOLATION, ##fun~$Pointer$~TO~VOIDErr1REQUIRES_VIOLATION, ##fun~$Pointer$~TO~VOIDErr2REQUIRES_VIOLATION (and 156 more)] === [2021-10-24 11:00:43,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 11:00:43,312 INFO L82 PathProgramCache]: Analyzing trace with hash 483741159, now seen corresponding path program 1 times [2021-10-24 11:00:43,312 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 11:00:43,312 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511912963] [2021-10-24 11:00:43,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 11:00:43,313 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 11:00:43,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 11:00:43,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-24 11:00:43,531 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 11:00:43,531 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511912963] [2021-10-24 11:00:43,531 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511912963] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-24 11:00:43,531 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-24 11:00:43,531 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-24 11:00:43,531 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487979604] [2021-10-24 11:00:43,532 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-24 11:00:43,532 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 11:00:43,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-24 11:00:43,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-10-24 11:00:43,532 INFO L87 Difference]: Start difference. First operand 354 states and 382 transitions. Second operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 11:00:44,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 11:00:44,229 INFO L93 Difference]: Finished difference Result 381 states and 414 transitions. [2021-10-24 11:00:44,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-24 11:00:44,230 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-10-24 11:00:44,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 11:00:44,232 INFO L225 Difference]: With dead ends: 381 [2021-10-24 11:00:44,232 INFO L226 Difference]: Without dead ends: 381 [2021-10-24 11:00:44,233 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 153.5ms TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2021-10-24 11:00:44,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2021-10-24 11:00:44,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 368. [2021-10-24 11:00:44,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 199 states have (on average 1.8542713567839195) internal successors, (369), 346 states have internal predecessors, (369), 15 states have call successors, (15), 10 states have call predecessors, (15), 7 states have return successors, (20), 11 states have call predecessors, (20), 15 states have call successors, (20) [2021-10-24 11:00:44,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 404 transitions. [2021-10-24 11:00:44,251 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 404 transitions. Word has length 15 [2021-10-24 11:00:44,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 11:00:44,252 INFO L470 AbstractCegarLoop]: Abstraction has 368 states and 404 transitions. [2021-10-24 11:00:44,252 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 11:00:44,252 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 404 transitions. [2021-10-24 11:00:44,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-10-24 11:00:44,253 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 11:00:44,253 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-24 11:00:44,253 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-24 11:00:44,253 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ##fun~$Pointer$~TO~VOIDErr4REQUIRES_VIOLATION === [##fun~$Pointer$~TO~VOIDErr0REQUIRES_VIOLATION, ##fun~$Pointer$~TO~VOIDErr1REQUIRES_VIOLATION, ##fun~$Pointer$~TO~VOIDErr2REQUIRES_VIOLATION (and 156 more)] === [2021-10-24 11:00:44,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 11:00:44,254 INFO L82 PathProgramCache]: Analyzing trace with hash 1544475002, now seen corresponding path program 1 times [2021-10-24 11:00:44,254 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 11:00:44,257 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461293595] [2021-10-24 11:00:44,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 11:00:44,257 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 11:00:44,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 11:00:44,380 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-24 11:00:44,380 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 11:00:44,380 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461293595] [2021-10-24 11:00:44,381 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461293595] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-24 11:00:44,381 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-24 11:00:44,381 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-24 11:00:44,381 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444586786] [2021-10-24 11:00:44,381 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-24 11:00:44,381 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 11:00:44,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-24 11:00:44,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-10-24 11:00:44,384 INFO L87 Difference]: Start difference. First operand 368 states and 404 transitions. Second operand has 7 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 2 states have call successors, (6), 2 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 11:00:44,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 11:00:44,823 INFO L93 Difference]: Finished difference Result 366 states and 402 transitions. [2021-10-24 11:00:44,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-24 11:00:44,824 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 2 states have call successors, (6), 2 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-10-24 11:00:44,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 11:00:44,827 INFO L225 Difference]: With dead ends: 366 [2021-10-24 11:00:44,827 INFO L226 Difference]: Without dead ends: 366 [2021-10-24 11:00:44,827 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 33.6ms TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2021-10-24 11:00:44,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2021-10-24 11:00:44,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 366. [2021-10-24 11:00:44,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 199 states have (on average 1.8442211055276383) internal successors, (367), 344 states have internal predecessors, (367), 15 states have call successors, (15), 10 states have call predecessors, (15), 7 states have return successors, (20), 11 states have call predecessors, (20), 15 states have call successors, (20) [2021-10-24 11:00:44,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 402 transitions. [2021-10-24 11:00:44,841 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 402 transitions. Word has length 23 [2021-10-24 11:00:44,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 11:00:44,841 INFO L470 AbstractCegarLoop]: Abstraction has 366 states and 402 transitions. [2021-10-24 11:00:44,841 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 2 states have call successors, (6), 2 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 11:00:44,841 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 402 transitions. [2021-10-24 11:00:44,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-10-24 11:00:44,842 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 11:00:44,842 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-24 11:00:44,842 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-24 11:00:44,843 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ##fun~$Pointer$~TO~VOIDErr5REQUIRES_VIOLATION === [##fun~$Pointer$~TO~VOIDErr0REQUIRES_VIOLATION, ##fun~$Pointer$~TO~VOIDErr1REQUIRES_VIOLATION, ##fun~$Pointer$~TO~VOIDErr2REQUIRES_VIOLATION (and 156 more)] === [2021-10-24 11:00:44,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 11:00:44,843 INFO L82 PathProgramCache]: Analyzing trace with hash 1544475003, now seen corresponding path program 1 times [2021-10-24 11:00:44,843 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 11:00:44,843 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160251755] [2021-10-24 11:00:44,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 11:00:44,844 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 11:00:44,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 11:00:44,957 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-24 11:00:44,957 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 11:00:44,957 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160251755] [2021-10-24 11:00:44,957 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160251755] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-24 11:00:44,958 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-24 11:00:44,958 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-24 11:00:44,958 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50589033] [2021-10-24 11:00:44,959 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-24 11:00:44,959 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 11:00:44,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-24 11:00:44,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-24 11:00:44,961 INFO L87 Difference]: Start difference. First operand 366 states and 402 transitions. Second operand has 6 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (6), 2 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 11:00:45,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 11:00:45,518 INFO L93 Difference]: Finished difference Result 364 states and 400 transitions. [2021-10-24 11:00:45,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-24 11:00:45,519 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (6), 2 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-10-24 11:00:45,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 11:00:45,521 INFO L225 Difference]: With dead ends: 364 [2021-10-24 11:00:45,521 INFO L226 Difference]: Without dead ends: 364 [2021-10-24 11:00:45,521 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 59.9ms TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-10-24 11:00:45,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2021-10-24 11:00:45,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 364. [2021-10-24 11:00:45,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 199 states have (on average 1.8341708542713568) internal successors, (365), 342 states have internal predecessors, (365), 15 states have call successors, (15), 10 states have call predecessors, (15), 7 states have return successors, (20), 11 states have call predecessors, (20), 15 states have call successors, (20) [2021-10-24 11:00:45,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 400 transitions. [2021-10-24 11:00:45,533 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 400 transitions. Word has length 23 [2021-10-24 11:00:45,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 11:00:45,533 INFO L470 AbstractCegarLoop]: Abstraction has 364 states and 400 transitions. [2021-10-24 11:00:45,533 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (6), 2 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 11:00:45,534 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 400 transitions. [2021-10-24 11:00:45,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-10-24 11:00:45,534 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 11:00:45,534 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-24 11:00:45,535 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-24 11:00:45,535 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ##fun~$Pointer$~TO~VOIDErr6REQUIRES_VIOLATION === [##fun~$Pointer$~TO~VOIDErr0REQUIRES_VIOLATION, ##fun~$Pointer$~TO~VOIDErr1REQUIRES_VIOLATION, ##fun~$Pointer$~TO~VOIDErr2REQUIRES_VIOLATION (and 156 more)] === [2021-10-24 11:00:45,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 11:00:45,535 INFO L82 PathProgramCache]: Analyzing trace with hash 634114193, now seen corresponding path program 1 times [2021-10-24 11:00:45,535 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 11:00:45,535 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211328582] [2021-10-24 11:00:45,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 11:00:45,536 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 11:00:45,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 11:00:45,574 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-10-24 11:00:45,574 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 11:00:45,574 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211328582] [2021-10-24 11:00:45,574 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211328582] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-24 11:00:45,574 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-24 11:00:45,574 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-24 11:00:45,574 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461914621] [2021-10-24 11:00:45,575 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-24 11:00:45,575 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 11:00:45,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-24 11:00:45,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-24 11:00:45,576 INFO L87 Difference]: Start difference. First operand 364 states and 400 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 11:00:45,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 11:00:45,779 INFO L93 Difference]: Finished difference Result 363 states and 399 transitions. [2021-10-24 11:00:45,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-24 11:00:45,779 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-10-24 11:00:45,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 11:00:45,782 INFO L225 Difference]: With dead ends: 363 [2021-10-24 11:00:45,782 INFO L226 Difference]: Without dead ends: 363 [2021-10-24 11:00:45,782 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-24 11:00:45,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2021-10-24 11:00:45,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 363. [2021-10-24 11:00:45,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 199 states have (on average 1.829145728643216) internal successors, (364), 341 states have internal predecessors, (364), 15 states have call successors, (15), 10 states have call predecessors, (15), 7 states have return successors, (20), 11 states have call predecessors, (20), 15 states have call successors, (20) [2021-10-24 11:00:45,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 399 transitions. [2021-10-24 11:00:45,793 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 399 transitions. Word has length 24 [2021-10-24 11:00:45,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 11:00:45,794 INFO L470 AbstractCegarLoop]: Abstraction has 363 states and 399 transitions. [2021-10-24 11:00:45,794 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 11:00:45,794 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 399 transitions. [2021-10-24 11:00:45,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-10-24 11:00:45,795 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 11:00:45,795 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-24 11:00:45,795 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-24 11:00:45,795 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ##fun~$Pointer$~TO~VOIDErr7REQUIRES_VIOLATION === [##fun~$Pointer$~TO~VOIDErr0REQUIRES_VIOLATION, ##fun~$Pointer$~TO~VOIDErr1REQUIRES_VIOLATION, ##fun~$Pointer$~TO~VOIDErr2REQUIRES_VIOLATION (and 156 more)] === [2021-10-24 11:00:45,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 11:00:45,795 INFO L82 PathProgramCache]: Analyzing trace with hash 634114194, now seen corresponding path program 1 times [2021-10-24 11:00:45,796 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 11:00:45,796 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410794801] [2021-10-24 11:00:45,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 11:00:45,796 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 11:00:45,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 11:00:45,848 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-10-24 11:00:45,848 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 11:00:45,848 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410794801] [2021-10-24 11:00:45,849 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410794801] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-24 11:00:45,849 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-24 11:00:45,849 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-24 11:00:45,849 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222904932] [2021-10-24 11:00:45,849 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-24 11:00:45,849 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 11:00:45,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-24 11:00:45,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-10-24 11:00:45,850 INFO L87 Difference]: Start difference. First operand 363 states and 399 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 11:00:46,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 11:00:46,034 INFO L93 Difference]: Finished difference Result 362 states and 398 transitions. [2021-10-24 11:00:46,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-24 11:00:46,035 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-10-24 11:00:46,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 11:00:46,038 INFO L225 Difference]: With dead ends: 362 [2021-10-24 11:00:46,039 INFO L226 Difference]: Without dead ends: 362 [2021-10-24 11:00:46,040 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 17.6ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-10-24 11:00:46,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2021-10-24 11:00:46,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 362. [2021-10-24 11:00:46,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 199 states have (on average 1.8241206030150754) internal successors, (363), 340 states have internal predecessors, (363), 15 states have call successors, (15), 10 states have call predecessors, (15), 7 states have return successors, (20), 11 states have call predecessors, (20), 15 states have call successors, (20) [2021-10-24 11:00:46,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 398 transitions. [2021-10-24 11:00:46,052 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 398 transitions. Word has length 24 [2021-10-24 11:00:46,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 11:00:46,052 INFO L470 AbstractCegarLoop]: Abstraction has 362 states and 398 transitions. [2021-10-24 11:00:46,053 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 11:00:46,053 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 398 transitions. [2021-10-24 11:00:46,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-10-24 11:00:46,055 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 11:00:46,055 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-24 11:00:46,055 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-24 11:00:46,055 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ##fun~$Pointer$~TO~VOIDErr8REQUIRES_VIOLATION === [##fun~$Pointer$~TO~VOIDErr0REQUIRES_VIOLATION, ##fun~$Pointer$~TO~VOIDErr1REQUIRES_VIOLATION, ##fun~$Pointer$~TO~VOIDErr2REQUIRES_VIOLATION (and 156 more)] === [2021-10-24 11:00:46,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 11:00:46,056 INFO L82 PathProgramCache]: Analyzing trace with hash -501616430, now seen corresponding path program 1 times [2021-10-24 11:00:46,056 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 11:00:46,056 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145279332] [2021-10-24 11:00:46,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 11:00:46,056 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 11:00:46,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 11:00:46,200 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-24 11:00:46,201 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 11:00:46,201 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145279332] [2021-10-24 11:00:46,201 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145279332] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-24 11:00:46,201 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-24 11:00:46,201 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-24 11:00:46,202 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086006713] [2021-10-24 11:00:46,202 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-24 11:00:46,202 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 11:00:46,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-24 11:00:46,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-10-24 11:00:46,203 INFO L87 Difference]: Start difference. First operand 362 states and 398 transitions. Second operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (6), 2 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 11:00:46,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 11:00:46,737 INFO L93 Difference]: Finished difference Result 371 states and 408 transitions. [2021-10-24 11:00:46,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-24 11:00:46,738 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (6), 2 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-10-24 11:00:46,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 11:00:46,740 INFO L225 Difference]: With dead ends: 371 [2021-10-24 11:00:46,740 INFO L226 Difference]: Without dead ends: 371 [2021-10-24 11:00:46,740 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 136.0ms TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2021-10-24 11:00:46,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2021-10-24 11:00:46,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 370. [2021-10-24 11:00:46,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 206 states have (on average 1.796116504854369) internal successors, (370), 348 states have internal predecessors, (370), 15 states have call successors, (15), 10 states have call predecessors, (15), 8 states have return successors, (22), 11 states have call predecessors, (22), 15 states have call successors, (22) [2021-10-24 11:00:46,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 407 transitions. [2021-10-24 11:00:46,752 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 407 transitions. Word has length 26 [2021-10-24 11:00:46,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 11:00:46,752 INFO L470 AbstractCegarLoop]: Abstraction has 370 states and 407 transitions. [2021-10-24 11:00:46,752 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (6), 2 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 11:00:46,753 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 407 transitions. [2021-10-24 11:00:46,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-24 11:00:46,754 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 11:00:46,754 INFO L512 BasicCegarLoop]: trace histogram [3, 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] [2021-10-24 11:00:46,754 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-10-24 11:00:46,754 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ##fun~$Pointer$~TO~VOIDErr8REQUIRES_VIOLATION === [##fun~$Pointer$~TO~VOIDErr0REQUIRES_VIOLATION, ##fun~$Pointer$~TO~VOIDErr1REQUIRES_VIOLATION, ##fun~$Pointer$~TO~VOIDErr2REQUIRES_VIOLATION (and 156 more)] === [2021-10-24 11:00:46,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 11:00:46,755 INFO L82 PathProgramCache]: Analyzing trace with hash 510736344, now seen corresponding path program 1 times [2021-10-24 11:00:46,755 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 11:00:46,755 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837025521] [2021-10-24 11:00:46,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 11:00:46,755 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 11:00:46,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 11:00:47,075 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-10-24 11:00:47,076 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 11:00:47,076 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837025521] [2021-10-24 11:00:47,076 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837025521] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-24 11:00:47,076 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1673007229] [2021-10-24 11:00:47,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 11:00:47,076 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-24 11:00:47,077 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397c4bc2-793d-47a2-8c40-75596478889c/bin/utaipan-9zjyvhn0QE/z3 [2021-10-24 11:00:47,081 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397c4bc2-793d-47a2-8c40-75596478889c/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-24 11:00:47,088 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397c4bc2-793d-47a2-8c40-75596478889c/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-10-24 11:00:47,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 11:00:47,255 INFO L263 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 47 conjunts are in the unsatisfiable core [2021-10-24 11:00:47,263 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-24 11:00:47,628 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2021-10-24 11:00:48,115 INFO L354 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2021-10-24 11:00:48,115 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 35 [2021-10-24 11:00:48,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-24 11:00:48,221 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 30 [2021-10-24 11:00:48,362 INFO L354 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2021-10-24 11:00:48,363 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 43 [2021-10-24 11:00:48,522 INFO L354 Elim1Store]: treesize reduction 30, result has 9.1 percent of original size [2021-10-24 11:00:48,522 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 38 [2021-10-24 11:00:48,613 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-24 11:00:48,613 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-24 11:00:56,347 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 99 [2021-10-24 11:00:56,427 INFO L354 Elim1Store]: treesize reduction 5, result has 89.8 percent of original size [2021-10-24 11:00:56,427 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 123 treesize of output 154 [2021-10-24 11:00:57,612 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 112 [2021-10-24 11:01:00,792 INFO L354 Elim1Store]: treesize reduction 5, result has 99.1 percent of original size [2021-10-24 11:01:00,793 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 12 select indices, 12 select index equivalence classes, 0 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 66 case distinctions, treesize of input 360 treesize of output 847 [2021-10-24 11:01:58,421 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-24 11:01:58,421 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1673007229] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-24 11:01:58,421 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1047418283] [2021-10-24 11:01:58,441 INFO L159 IcfgInterpreter]: Started Sifa with 27 locations of interest [2021-10-24 11:01:58,441 INFO L166 IcfgInterpreter]: Building call graph [2021-10-24 11:01:58,462 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:608) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-10-24 11:01:58,464 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-24 11:01:58,464 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 39 [2021-10-24 11:01:58,464 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176310973] [2021-10-24 11:01:58,465 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2021-10-24 11:01:58,465 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 11:01:58,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2021-10-24 11:01:58,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1415, Unknown=5, NotChecked=0, Total=1560 [2021-10-24 11:01:58,467 INFO L87 Difference]: Start difference. First operand 370 states and 407 transitions. Second operand has 40 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 35 states have internal predecessors, (62), 6 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-10-24 11:02:02,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 11:02:02,631 INFO L93 Difference]: Finished difference Result 372 states and 408 transitions. [2021-10-24 11:02:02,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-24 11:02:02,632 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 35 states have internal predecessors, (62), 6 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 37 [2021-10-24 11:02:02,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 11:02:02,635 INFO L225 Difference]: With dead ends: 372 [2021-10-24 11:02:02,635 INFO L226 Difference]: Without dead ends: 372 [2021-10-24 11:02:02,637 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 560 ImplicationChecksByTransitivity, 10651.4ms TimeCoverageRelationStatistics Valid=415, Invalid=2231, Unknown=6, NotChecked=0, Total=2652 [2021-10-24 11:02:02,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2021-10-24 11:02:02,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 369. [2021-10-24 11:02:02,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 206 states have (on average 1.7912621359223302) internal successors, (369), 347 states have internal predecessors, (369), 15 states have call successors, (15), 10 states have call predecessors, (15), 8 states have return successors, (20), 11 states have call predecessors, (20), 15 states have call successors, (20) [2021-10-24 11:02:02,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 404 transitions. [2021-10-24 11:02:02,649 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 404 transitions. Word has length 37 [2021-10-24 11:02:02,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 11:02:02,649 INFO L470 AbstractCegarLoop]: Abstraction has 369 states and 404 transitions. [2021-10-24 11:02:02,650 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 35 states have internal predecessors, (62), 6 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-10-24 11:02:02,650 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 404 transitions. [2021-10-24 11:02:02,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-24 11:02:02,651 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 11:02:02,651 INFO L512 BasicCegarLoop]: trace histogram [3, 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] [2021-10-24 11:02:02,690 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397c4bc2-793d-47a2-8c40-75596478889c/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-10-24 11:02:02,865 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397c4bc2-793d-47a2-8c40-75596478889c/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-10-24 11:02:02,866 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ##fun~$Pointer$~TO~VOIDErr9REQUIRES_VIOLATION === [##fun~$Pointer$~TO~VOIDErr0REQUIRES_VIOLATION, ##fun~$Pointer$~TO~VOIDErr1REQUIRES_VIOLATION, ##fun~$Pointer$~TO~VOIDErr2REQUIRES_VIOLATION (and 156 more)] === [2021-10-24 11:02:02,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 11:02:02,866 INFO L82 PathProgramCache]: Analyzing trace with hash 510736345, now seen corresponding path program 1 times [2021-10-24 11:02:02,866 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 11:02:02,866 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319162520] [2021-10-24 11:02:02,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 11:02:02,866 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 11:02:02,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 11:02:03,202 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-10-24 11:02:03,202 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 11:02:03,202 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319162520] [2021-10-24 11:02:03,203 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319162520] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-24 11:02:03,203 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [169202344] [2021-10-24 11:02:03,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 11:02:03,203 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-24 11:02:03,203 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397c4bc2-793d-47a2-8c40-75596478889c/bin/utaipan-9zjyvhn0QE/z3 [2021-10-24 11:02:03,205 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397c4bc2-793d-47a2-8c40-75596478889c/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-24 11:02:03,205 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397c4bc2-793d-47a2-8c40-75596478889c/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-10-24 11:02:03,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 11:02:03,417 INFO L263 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 67 conjunts are in the unsatisfiable core [2021-10-24 11:02:03,421 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-24 11:02:03,523 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-10-24 11:02:03,749 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 35 [2021-10-24 11:02:03,753 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2021-10-24 11:02:04,083 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-10-24 11:02:04,083 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 45 [2021-10-24 11:02:04,091 INFO L354 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2021-10-24 11:02:04,091 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 42 [2021-10-24 11:02:04,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-24 11:02:04,193 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 52 [2021-10-24 11:02:04,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-24 11:02:04,198 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 44 [2021-10-24 11:02:04,311 INFO L354 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2021-10-24 11:02:04,311 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 77 treesize of output 68 [2021-10-24 11:02:04,338 INFO L354 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2021-10-24 11:02:04,338 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 66 treesize of output 61 [2021-10-24 11:02:04,485 INFO L354 Elim1Store]: treesize reduction 30, result has 9.1 percent of original size [2021-10-24 11:02:04,485 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 59 [2021-10-24 11:02:04,508 INFO L354 Elim1Store]: treesize reduction 30, result has 9.1 percent of original size [2021-10-24 11:02:04,508 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 41 [2021-10-24 11:02:04,598 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-24 11:02:04,598 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-24 11:02:06,289 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0.offset| Int)) (<= 0 (+ 4 (select (select (store |c_#memory_$Pointer$.offset| |c_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0.base| (store (select |c_#memory_$Pointer$.offset| |c_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0.base|) |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0.offset| 0)) |c_##fun~$Pointer$~TO~VOID_dll_insert_slave_~dll.base|) |c_##fun~$Pointer$~TO~VOID_dll_insert_slave_~dll.offset|)))) (forall ((|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0.offset| Int)) (<= (+ 8 (select (select (store |c_#memory_$Pointer$.offset| |c_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0.base| (store (select |c_#memory_$Pointer$.offset| |c_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0.base|) |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0.offset| 0)) |c_##fun~$Pointer$~TO~VOID_dll_insert_slave_~dll.base|) |c_##fun~$Pointer$~TO~VOID_dll_insert_slave_~dll.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0.base| (store (select |c_#memory_$Pointer$.base| |c_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0.base|) |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0.offset| 0)) |c_##fun~$Pointer$~TO~VOID_dll_insert_slave_~dll.base|) |c_##fun~$Pointer$~TO~VOID_dll_insert_slave_~dll.offset|))))) is different from false [2021-10-24 11:02:17,007 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 270 treesize of output 266 [2021-10-24 11:02:17,012 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 489 treesize of output 469 [2021-10-24 11:02:17,035 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-10-24 11:02:17,036 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 615 treesize of output 599 [2021-10-24 11:02:17,081 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-10-24 11:02:17,082 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 467 treesize of output 466 [2021-10-24 11:02:18,840 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 271 treesize of output 267 [2021-10-24 11:02:18,846 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 526 treesize of output 506 [2021-10-24 11:02:20,721 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-10-24 11:02:20,722 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 166 treesize of output 165 [2021-10-24 11:02:22,032 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 1 not checked. [2021-10-24 11:02:22,032 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [169202344] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-24 11:02:22,033 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1975534284] [2021-10-24 11:02:22,035 INFO L159 IcfgInterpreter]: Started Sifa with 27 locations of interest [2021-10-24 11:02:22,036 INFO L166 IcfgInterpreter]: Building call graph [2021-10-24 11:02:22,036 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:608) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-10-24 11:02:22,043 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-24 11:02:22,043 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15, 15] total 40 [2021-10-24 11:02:22,043 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78666314] [2021-10-24 11:02:22,044 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2021-10-24 11:02:22,044 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 11:02:22,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2021-10-24 11:02:22,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=1422, Unknown=6, NotChecked=76, Total=1640 [2021-10-24 11:02:22,047 INFO L87 Difference]: Start difference. First operand 369 states and 404 transitions. Second operand has 41 states, 35 states have (on average 1.8285714285714285) internal successors, (64), 36 states have internal predecessors, (64), 6 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-10-24 11:02:26,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 11:02:26,326 INFO L93 Difference]: Finished difference Result 368 states and 403 transitions. [2021-10-24 11:02:26,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-10-24 11:02:26,337 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 35 states have (on average 1.8285714285714285) internal successors, (64), 36 states have internal predecessors, (64), 6 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 37 [2021-10-24 11:02:26,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 11:02:26,340 INFO L225 Difference]: With dead ends: 368 [2021-10-24 11:02:26,340 INFO L226 Difference]: Without dead ends: 368 [2021-10-24 11:02:26,342 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 514 ImplicationChecksByTransitivity, 14283.8ms TimeCoverageRelationStatistics Valid=458, Invalid=2402, Unknown=6, NotChecked=104, Total=2970 [2021-10-24 11:02:26,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2021-10-24 11:02:26,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 368. [2021-10-24 11:02:26,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 206 states have (on average 1.7864077669902914) internal successors, (368), 346 states have internal predecessors, (368), 15 states have call successors, (15), 10 states have call predecessors, (15), 8 states have return successors, (20), 11 states have call predecessors, (20), 15 states have call successors, (20) [2021-10-24 11:02:26,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 403 transitions. [2021-10-24 11:02:26,353 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 403 transitions. Word has length 37 [2021-10-24 11:02:26,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 11:02:26,353 INFO L470 AbstractCegarLoop]: Abstraction has 368 states and 403 transitions. [2021-10-24 11:02:26,354 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 35 states have (on average 1.8285714285714285) internal successors, (64), 36 states have internal predecessors, (64), 6 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-10-24 11:02:26,354 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 403 transitions. [2021-10-24 11:02:26,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-10-24 11:02:26,355 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 11:02:26,355 INFO L512 BasicCegarLoop]: trace histogram [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] [2021-10-24 11:02:26,390 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397c4bc2-793d-47a2-8c40-75596478889c/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-10-24 11:02:26,569 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397c4bc2-793d-47a2-8c40-75596478889c/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-10-24 11:02:26,570 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting dll_insert_masterErr10REQUIRES_VIOLATION === [##fun~$Pointer$~TO~VOIDErr0REQUIRES_VIOLATION, ##fun~$Pointer$~TO~VOIDErr1REQUIRES_VIOLATION, ##fun~$Pointer$~TO~VOIDErr2REQUIRES_VIOLATION (and 156 more)] === [2021-10-24 11:02:26,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 11:02:26,570 INFO L82 PathProgramCache]: Analyzing trace with hash 1249289076, now seen corresponding path program 1 times [2021-10-24 11:02:26,570 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 11:02:26,570 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025059593] [2021-10-24 11:02:26,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 11:02:26,570 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 11:02:26,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 11:02:26,682 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-24 11:02:26,682 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 11:02:26,683 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025059593] [2021-10-24 11:02:26,683 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025059593] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-24 11:02:26,683 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-24 11:02:26,683 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-24 11:02:26,684 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932722923] [2021-10-24 11:02:26,685 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-24 11:02:26,685 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 11:02:26,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-24 11:02:26,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-24 11:02:26,687 INFO L87 Difference]: Start difference. First operand 368 states and 403 transitions. Second operand has 5 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-24 11:02:26,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 11:02:26,722 INFO L93 Difference]: Finished difference Result 357 states and 380 transitions. [2021-10-24 11:02:26,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-24 11:02:26,723 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2021-10-24 11:02:26,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 11:02:26,725 INFO L225 Difference]: With dead ends: 357 [2021-10-24 11:02:26,725 INFO L226 Difference]: Without dead ends: 357 [2021-10-24 11:02:26,726 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.8ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-10-24 11:02:26,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2021-10-24 11:02:26,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 357. [2021-10-24 11:02:26,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 198 states have (on average 1.792929292929293) internal successors, (355), 338 states have internal predecessors, (355), 12 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (13), 9 states have call predecessors, (13), 12 states have call successors, (13) [2021-10-24 11:02:26,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 380 transitions. [2021-10-24 11:02:26,736 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 380 transitions. Word has length 40 [2021-10-24 11:02:26,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 11:02:26,737 INFO L470 AbstractCegarLoop]: Abstraction has 357 states and 380 transitions. [2021-10-24 11:02:26,737 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-24 11:02:26,737 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 380 transitions. [2021-10-24 11:02:26,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-10-24 11:02:26,739 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 11:02:26,740 INFO L512 BasicCegarLoop]: trace histogram [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] [2021-10-24 11:02:26,740 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-10-24 11:02:26,740 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting dll_insert_masterErr12REQUIRES_VIOLATION === [##fun~$Pointer$~TO~VOIDErr0REQUIRES_VIOLATION, ##fun~$Pointer$~TO~VOIDErr1REQUIRES_VIOLATION, ##fun~$Pointer$~TO~VOIDErr2REQUIRES_VIOLATION (and 156 more)] === [2021-10-24 11:02:26,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 11:02:26,741 INFO L82 PathProgramCache]: Analyzing trace with hash 715579460, now seen corresponding path program 1 times [2021-10-24 11:02:26,741 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 11:02:26,741 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574302412] [2021-10-24 11:02:26,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 11:02:26,741 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 11:02:26,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 11:02:27,128 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-10-24 11:02:27,129 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 11:02:27,129 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574302412] [2021-10-24 11:02:27,129 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574302412] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-24 11:02:27,129 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [551150780] [2021-10-24 11:02:27,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 11:02:27,129 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-24 11:02:27,129 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397c4bc2-793d-47a2-8c40-75596478889c/bin/utaipan-9zjyvhn0QE/z3 [2021-10-24 11:02:27,130 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397c4bc2-793d-47a2-8c40-75596478889c/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-24 11:02:27,131 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397c4bc2-793d-47a2-8c40-75596478889c/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-10-24 11:02:27,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 11:02:27,480 INFO L263 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 59 conjunts are in the unsatisfiable core [2021-10-24 11:02:27,484 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-24 11:02:27,615 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-10-24 11:02:45,605 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-24 11:02:45,605 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-24 11:04:02,482 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-10-24 11:04:02,482 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 1 [2021-10-24 11:04:06,562 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 69 [2021-10-24 11:04:06,722 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-10-24 11:04:06,723 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 27 [2021-10-24 11:04:06,789 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-10-24 11:04:06,789 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [551150780] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-24 11:04:06,790 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [207935918] [2021-10-24 11:04:06,792 INFO L159 IcfgInterpreter]: Started Sifa with 33 locations of interest [2021-10-24 11:04:06,792 INFO L166 IcfgInterpreter]: Building call graph [2021-10-24 11:04:06,793 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:608) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-10-24 11:04:06,793 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-24 11:04:06,804 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 15] total 34 [2021-10-24 11:04:06,804 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935172772] [2021-10-24 11:04:06,807 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-10-24 11:04:06,807 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 11:04:06,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-10-24 11:04:06,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=964, Unknown=41, NotChecked=0, Total=1122 [2021-10-24 11:04:06,809 INFO L87 Difference]: Start difference. First operand 357 states and 380 transitions. Second operand has 34 states, 30 states have (on average 1.8333333333333333) internal successors, (55), 29 states have internal predecessors, (55), 5 states have call successors, (9), 3 states have call predecessors, (9), 5 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) [2021-10-24 11:04:45,372 WARN L207 SmtUtils]: Spent 8.04 s on a formula simplification that was a NOOP. DAG size: 48 [2021-10-24 11:05:36,873 WARN L207 SmtUtils]: Spent 6.05 s on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2021-10-24 11:05:42,968 WARN L207 SmtUtils]: Spent 6.06 s on a formula simplification. DAG size of input: 52 DAG size of output: 40 [2021-10-24 11:06:19,362 WARN L207 SmtUtils]: Spent 8.04 s on a formula simplification that was a NOOP. DAG size: 51 [2021-10-24 11:06:37,550 WARN L207 SmtUtils]: Spent 10.06 s on a formula simplification that was a NOOP. DAG size: 55 [2021-10-24 11:07:00,044 WARN L207 SmtUtils]: Spent 6.05 s on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2021-10-24 11:07:24,212 WARN L207 SmtUtils]: Spent 16.08 s on a formula simplification. DAG size of input: 61 DAG size of output: 54 [2021-10-24 11:07:53,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 11:07:53,907 INFO L93 Difference]: Finished difference Result 360 states and 382 transitions. [2021-10-24 11:07:53,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-10-24 11:07:53,908 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 30 states have (on average 1.8333333333333333) internal successors, (55), 29 states have internal predecessors, (55), 5 states have call successors, (9), 3 states have call predecessors, (9), 5 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) Word has length 46 [2021-10-24 11:07:53,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 11:07:53,910 INFO L225 Difference]: With dead ends: 360 [2021-10-24 11:07:53,910 INFO L226 Difference]: Without dead ends: 357 [2021-10-24 11:07:53,912 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 541 ImplicationChecksByTransitivity, 241571.0ms TimeCoverageRelationStatistics Valid=417, Invalid=2368, Unknown=77, NotChecked=0, Total=2862 [2021-10-24 11:07:53,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2021-10-24 11:07:53,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 357. [2021-10-24 11:07:53,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 198 states have (on average 1.7878787878787878) internal successors, (354), 338 states have internal predecessors, (354), 12 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (13), 9 states have call predecessors, (13), 12 states have call successors, (13) [2021-10-24 11:07:53,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 379 transitions. [2021-10-24 11:07:53,922 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 379 transitions. Word has length 46 [2021-10-24 11:07:53,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 11:07:53,922 INFO L470 AbstractCegarLoop]: Abstraction has 357 states and 379 transitions. [2021-10-24 11:07:53,922 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 30 states have (on average 1.8333333333333333) internal successors, (55), 29 states have internal predecessors, (55), 5 states have call successors, (9), 3 states have call predecessors, (9), 5 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) [2021-10-24 11:07:53,923 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 379 transitions. [2021-10-24 11:07:53,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-10-24 11:07:53,923 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 11:07:53,923 INFO L512 BasicCegarLoop]: trace histogram [3, 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] [2021-10-24 11:07:53,962 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397c4bc2-793d-47a2-8c40-75596478889c/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-10-24 11:07:54,137 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397c4bc2-793d-47a2-8c40-75596478889c/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-24 11:07:54,138 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting dll_insert_masterErr12REQUIRES_VIOLATION === [##fun~$Pointer$~TO~VOIDErr0REQUIRES_VIOLATION, ##fun~$Pointer$~TO~VOIDErr1REQUIRES_VIOLATION, ##fun~$Pointer$~TO~VOIDErr2REQUIRES_VIOLATION (and 156 more)] === [2021-10-24 11:07:54,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 11:07:54,138 INFO L82 PathProgramCache]: Analyzing trace with hash -633747766, now seen corresponding path program 1 times [2021-10-24 11:07:54,138 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 11:07:54,138 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087237006] [2021-10-24 11:07:54,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 11:07:54,138 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 11:07:54,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 11:07:55,430 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-24 11:07:55,430 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 11:07:55,430 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087237006] [2021-10-24 11:07:55,430 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087237006] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-24 11:07:55,431 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [670222483] [2021-10-24 11:07:55,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 11:07:55,431 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-24 11:07:55,431 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397c4bc2-793d-47a2-8c40-75596478889c/bin/utaipan-9zjyvhn0QE/z3 [2021-10-24 11:07:55,432 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397c4bc2-793d-47a2-8c40-75596478889c/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-24 11:07:55,433 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397c4bc2-793d-47a2-8c40-75596478889c/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-10-24 11:07:55,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 11:07:55,823 INFO L263 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 30 conjunts are in the unsatisfiable core [2021-10-24 11:07:55,826 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-24 11:07:55,848 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-10-24 11:07:55,948 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2021-10-24 11:07:56,198 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-10-24 11:07:56,198 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 17 [2021-10-24 11:07:56,688 INFO L354 Elim1Store]: treesize reduction 109, result has 18.0 percent of original size [2021-10-24 11:07:56,688 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 40 treesize of output 47 [2021-10-24 11:07:56,785 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-24 11:07:56,785 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-24 11:08:21,160 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-10-24 11:08:21,161 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 293 treesize of output 401 [2021-10-24 11:09:02,050 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-24 11:09:02,050 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [670222483] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-24 11:09:02,050 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [600481502] [2021-10-24 11:09:02,053 INFO L159 IcfgInterpreter]: Started Sifa with 34 locations of interest [2021-10-24 11:09:02,053 INFO L166 IcfgInterpreter]: Building call graph [2021-10-24 11:09:02,053 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:608) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-10-24 11:09:02,053 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-24 11:09:02,054 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 13, 12] total 41 [2021-10-24 11:09:02,054 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991593313] [2021-10-24 11:09:02,054 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2021-10-24 11:09:02,054 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 11:09:02,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2021-10-24 11:09:02,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=1424, Unknown=29, NotChecked=0, Total=1640 [2021-10-24 11:09:02,056 INFO L87 Difference]: Start difference. First operand 357 states and 379 transitions. Second operand has 41 states, 34 states have (on average 2.6470588235294117) internal successors, (90), 35 states have internal predecessors, (90), 11 states have call successors, (13), 6 states have call predecessors, (13), 10 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2021-10-24 11:09:13,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 11:09:13,169 INFO L93 Difference]: Finished difference Result 20 states and 19 transitions. [2021-10-24 11:09:13,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-24 11:09:13,169 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 34 states have (on average 2.6470588235294117) internal successors, (90), 35 states have internal predecessors, (90), 11 states have call successors, (13), 6 states have call predecessors, (13), 10 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) Word has length 47 [2021-10-24 11:09:13,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 11:09:13,170 INFO L225 Difference]: With dead ends: 20 [2021-10-24 11:09:13,170 INFO L226 Difference]: Without dead ends: 0 [2021-10-24 11:09:13,171 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 81 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 600 ImplicationChecksByTransitivity, 73346.8ms TimeCoverageRelationStatistics Valid=303, Invalid=2117, Unknown=30, NotChecked=0, Total=2450 [2021-10-24 11:09:13,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-10-24 11:09:13,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-10-24 11:09:13,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 11:09:13,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-10-24 11:09:13,171 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 47 [2021-10-24 11:09:13,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 11:09:13,171 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-10-24 11:09:13,172 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 34 states have (on average 2.6470588235294117) internal successors, (90), 35 states have internal predecessors, (90), 11 states have call successors, (13), 6 states have call predecessors, (13), 10 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2021-10-24 11:09:13,172 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-10-24 11:09:13,172 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-10-24 11:09:13,175 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ##fun~$Pointer$~TO~VOIDErr0REQUIRES_VIOLATION [2021-10-24 11:09:13,175 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ##fun~$Pointer$~TO~VOIDErr1REQUIRES_VIOLATION [2021-10-24 11:09:13,175 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ##fun~$Pointer$~TO~VOIDErr2REQUIRES_VIOLATION [2021-10-24 11:09:13,175 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ##fun~$Pointer$~TO~VOIDErr3REQUIRES_VIOLATION [2021-10-24 11:09:13,176 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ##fun~$Pointer$~TO~VOIDErr4REQUIRES_VIOLATION [2021-10-24 11:09:13,176 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ##fun~$Pointer$~TO~VOIDErr5REQUIRES_VIOLATION [2021-10-24 11:09:13,176 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ##fun~$Pointer$~TO~VOIDErr6REQUIRES_VIOLATION [2021-10-24 11:09:13,176 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ##fun~$Pointer$~TO~VOIDErr7REQUIRES_VIOLATION [2021-10-24 11:09:13,176 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ##fun~$Pointer$~TO~VOIDErr8REQUIRES_VIOLATION [2021-10-24 11:09:13,176 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ##fun~$Pointer$~TO~VOIDErr9REQUIRES_VIOLATION [2021-10-24 11:09:13,177 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ##fun~$Pointer$~TO~VOIDErr10REQUIRES_VIOLATION [2021-10-24 11:09:13,177 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ##fun~$Pointer$~TO~VOIDErr11REQUIRES_VIOLATION [2021-10-24 11:09:13,177 INFO L764 garLoopResultBuilder]: Registering result SAFE for location dll_insert_masterErr0REQUIRES_VIOLATION [2021-10-24 11:09:13,177 INFO L764 garLoopResultBuilder]: Registering result SAFE for location dll_insert_masterErr1REQUIRES_VIOLATION [2021-10-24 11:09:13,177 INFO L764 garLoopResultBuilder]: Registering result SAFE for location dll_insert_masterErr2REQUIRES_VIOLATION [2021-10-24 11:09:13,177 INFO L764 garLoopResultBuilder]: Registering result SAFE for location dll_insert_masterErr3REQUIRES_VIOLATION [2021-10-24 11:09:13,178 INFO L764 garLoopResultBuilder]: Registering result SAFE for location dll_insert_masterErr4REQUIRES_VIOLATION [2021-10-24 11:09:13,178 INFO L764 garLoopResultBuilder]: Registering result SAFE for location dll_insert_masterErr5REQUIRES_VIOLATION [2021-10-24 11:09:13,178 INFO L764 garLoopResultBuilder]: Registering result SAFE for location dll_insert_masterErr6REQUIRES_VIOLATION [2021-10-24 11:09:13,178 INFO L764 garLoopResultBuilder]: Registering result SAFE for location dll_insert_masterErr7REQUIRES_VIOLATION [2021-10-24 11:09:13,178 INFO L764 garLoopResultBuilder]: Registering result SAFE for location dll_insert_masterErr8REQUIRES_VIOLATION [2021-10-24 11:09:13,178 INFO L764 garLoopResultBuilder]: Registering result SAFE for location dll_insert_masterErr9REQUIRES_VIOLATION [2021-10-24 11:09:13,179 INFO L764 garLoopResultBuilder]: Registering result SAFE for location dll_insert_masterErr10REQUIRES_VIOLATION [2021-10-24 11:09:13,179 INFO L764 garLoopResultBuilder]: Registering result SAFE for location dll_insert_masterErr11REQUIRES_VIOLATION [2021-10-24 11:09:13,179 INFO L764 garLoopResultBuilder]: Registering result SAFE for location dll_insert_masterErr12REQUIRES_VIOLATION [2021-10-24 11:09:13,179 INFO L764 garLoopResultBuilder]: Registering result SAFE for location dll_insert_masterErr13REQUIRES_VIOLATION [2021-10-24 11:09:13,179 INFO L764 garLoopResultBuilder]: Registering result SAFE for location dll_insert_masterErr14REQUIRES_VIOLATION [2021-10-24 11:09:13,179 INFO L764 garLoopResultBuilder]: Registering result SAFE for location dll_insert_masterErr15REQUIRES_VIOLATION [2021-10-24 11:09:13,179 INFO L764 garLoopResultBuilder]: Registering result SAFE for location dll_create_genericErr0REQUIRES_VIOLATION [2021-10-24 11:09:13,180 INFO L764 garLoopResultBuilder]: Registering result SAFE for location dll_create_genericErr1REQUIRES_VIOLATION [2021-10-24 11:09:13,180 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK [2021-10-24 11:09:13,180 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATION [2021-10-24 11:09:13,180 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATION [2021-10-24 11:09:13,180 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK [2021-10-24 11:09:13,181 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATION [2021-10-24 11:09:13,181 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATION [2021-10-24 11:09:13,181 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK [2021-10-24 11:09:13,181 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATION [2021-10-24 11:09:13,181 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATION [2021-10-24 11:09:13,181 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATION [2021-10-24 11:09:13,182 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATION [2021-10-24 11:09:13,182 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK [2021-10-24 11:09:13,182 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATION [2021-10-24 11:09:13,182 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATION [2021-10-24 11:09:13,182 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14REQUIRES_VIOLATION [2021-10-24 11:09:13,182 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15REQUIRES_VIOLATION [2021-10-24 11:09:13,183 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK [2021-10-24 11:09:13,183 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17REQUIRES_VIOLATION [2021-10-24 11:09:13,183 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18REQUIRES_VIOLATION [2021-10-24 11:09:13,183 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19REQUIRES_VIOLATION [2021-10-24 11:09:13,183 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20REQUIRES_VIOLATION [2021-10-24 11:09:13,183 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK [2021-10-24 11:09:13,184 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22REQUIRES_VIOLATION [2021-10-24 11:09:13,184 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23REQUIRES_VIOLATION [2021-10-24 11:09:13,184 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24REQUIRES_VIOLATION [2021-10-24 11:09:13,184 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25REQUIRES_VIOLATION [2021-10-24 11:09:13,184 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK [2021-10-24 11:09:13,184 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27REQUIRES_VIOLATION [2021-10-24 11:09:13,185 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28REQUIRES_VIOLATION [2021-10-24 11:09:13,185 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK [2021-10-24 11:09:13,185 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30REQUIRES_VIOLATION [2021-10-24 11:09:13,185 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31REQUIRES_VIOLATION [2021-10-24 11:09:13,185 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK [2021-10-24 11:09:13,185 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr33REQUIRES_VIOLATION [2021-10-24 11:09:13,186 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr34REQUIRES_VIOLATION [2021-10-24 11:09:13,186 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr35REQUIRES_VIOLATION [2021-10-24 11:09:13,186 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr36REQUIRES_VIOLATION [2021-10-24 11:09:13,186 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK [2021-10-24 11:09:13,186 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr38REQUIRES_VIOLATION [2021-10-24 11:09:13,186 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr39REQUIRES_VIOLATION [2021-10-24 11:09:13,187 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr40REQUIRES_VIOLATION [2021-10-24 11:09:13,187 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr41REQUIRES_VIOLATION [2021-10-24 11:09:13,187 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK [2021-10-24 11:09:13,187 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr43REQUIRES_VIOLATION [2021-10-24 11:09:13,187 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr44REQUIRES_VIOLATION [2021-10-24 11:09:13,187 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr45REQUIRES_VIOLATION [2021-10-24 11:09:13,188 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr46REQUIRES_VIOLATION [2021-10-24 11:09:13,188 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_LEAK [2021-10-24 11:09:13,188 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr48REQUIRES_VIOLATION [2021-10-24 11:09:13,188 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr49REQUIRES_VIOLATION [2021-10-24 11:09:13,188 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr50REQUIRES_VIOLATION [2021-10-24 11:09:13,188 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr51REQUIRES_VIOLATION [2021-10-24 11:09:13,189 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr52REQUIRES_VIOLATION [2021-10-24 11:09:13,189 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr53REQUIRES_VIOLATION [2021-10-24 11:09:13,189 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr54REQUIRES_VIOLATION [2021-10-24 11:09:13,189 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr55REQUIRES_VIOLATION [2021-10-24 11:09:13,189 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE [2021-10-24 11:09:13,189 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE [2021-10-24 11:09:13,190 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE [2021-10-24 11:09:13,190 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr59REQUIRES_VIOLATION [2021-10-24 11:09:13,190 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr60REQUIRES_VIOLATION [2021-10-24 11:09:13,190 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_LEAK [2021-10-24 11:09:13,190 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr62REQUIRES_VIOLATION [2021-10-24 11:09:13,190 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr63REQUIRES_VIOLATION [2021-10-24 11:09:13,191 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK [2021-10-24 11:09:13,191 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr65REQUIRES_VIOLATION [2021-10-24 11:09:13,191 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr66REQUIRES_VIOLATION [2021-10-24 11:09:13,191 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_LEAK [2021-10-24 11:09:13,191 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr68REQUIRES_VIOLATION [2021-10-24 11:09:13,191 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr69REQUIRES_VIOLATION [2021-10-24 11:09:13,192 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr70REQUIRES_VIOLATION [2021-10-24 11:09:13,192 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr71REQUIRES_VIOLATION [2021-10-24 11:09:13,192 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr72ASSERT_VIOLATIONMEMORY_LEAK [2021-10-24 11:09:13,192 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr73REQUIRES_VIOLATION [2021-10-24 11:09:13,192 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr74REQUIRES_VIOLATION [2021-10-24 11:09:13,192 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr75REQUIRES_VIOLATION [2021-10-24 11:09:13,193 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr76REQUIRES_VIOLATION [2021-10-24 11:09:13,193 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_LEAK [2021-10-24 11:09:13,193 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr78REQUIRES_VIOLATION [2021-10-24 11:09:13,193 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr79REQUIRES_VIOLATION [2021-10-24 11:09:13,193 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr80REQUIRES_VIOLATION [2021-10-24 11:09:13,193 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr81REQUIRES_VIOLATION [2021-10-24 11:09:13,194 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr82ASSERT_VIOLATIONMEMORY_LEAK [2021-10-24 11:09:13,194 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr83REQUIRES_VIOLATION [2021-10-24 11:09:13,194 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr84REQUIRES_VIOLATION [2021-10-24 11:09:13,194 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr85REQUIRES_VIOLATION [2021-10-24 11:09:13,194 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr86REQUIRES_VIOLATION [2021-10-24 11:09:13,194 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr87ASSERT_VIOLATIONMEMORY_LEAK [2021-10-24 11:09:13,195 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr88REQUIRES_VIOLATION [2021-10-24 11:09:13,195 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr89REQUIRES_VIOLATION [2021-10-24 11:09:13,195 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr90REQUIRES_VIOLATION [2021-10-24 11:09:13,195 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr91REQUIRES_VIOLATION [2021-10-24 11:09:13,195 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr92REQUIRES_VIOLATION [2021-10-24 11:09:13,195 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr93REQUIRES_VIOLATION [2021-10-24 11:09:13,196 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr94ASSERT_VIOLATIONMEMORY_LEAK [2021-10-24 11:09:13,196 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr95REQUIRES_VIOLATION [2021-10-24 11:09:13,196 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr96REQUIRES_VIOLATION [2021-10-24 11:09:13,196 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr97ASSERT_VIOLATIONMEMORY_LEAK [2021-10-24 11:09:13,196 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr98REQUIRES_VIOLATION [2021-10-24 11:09:13,196 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr99REQUIRES_VIOLATION [2021-10-24 11:09:13,197 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr100ASSERT_VIOLATIONMEMORY_LEAK [2021-10-24 11:09:13,197 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr101REQUIRES_VIOLATION [2021-10-24 11:09:13,197 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr102REQUIRES_VIOLATION [2021-10-24 11:09:13,197 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr103REQUIRES_VIOLATION [2021-10-24 11:09:13,197 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr104REQUIRES_VIOLATION [2021-10-24 11:09:13,197 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr105ASSERT_VIOLATIONMEMORY_LEAK [2021-10-24 11:09:13,197 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr106REQUIRES_VIOLATION [2021-10-24 11:09:13,197 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr107REQUIRES_VIOLATION [2021-10-24 11:09:13,198 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr108REQUIRES_VIOLATION [2021-10-24 11:09:13,198 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr109REQUIRES_VIOLATION [2021-10-24 11:09:13,198 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr110ASSERT_VIOLATIONMEMORY_LEAK [2021-10-24 11:09:13,198 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr111REQUIRES_VIOLATION [2021-10-24 11:09:13,198 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr112REQUIRES_VIOLATION [2021-10-24 11:09:13,198 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr113REQUIRES_VIOLATION [2021-10-24 11:09:13,199 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr114REQUIRES_VIOLATION [2021-10-24 11:09:13,199 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr115ASSERT_VIOLATIONMEMORY_LEAK [2021-10-24 11:09:13,199 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr116REQUIRES_VIOLATION [2021-10-24 11:09:13,199 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr117REQUIRES_VIOLATION [2021-10-24 11:09:13,199 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr118REQUIRES_VIOLATION [2021-10-24 11:09:13,199 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr119REQUIRES_VIOLATION [2021-10-24 11:09:13,200 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr120ASSERT_VIOLATIONMEMORY_LEAK [2021-10-24 11:09:13,200 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr121REQUIRES_VIOLATION [2021-10-24 11:09:13,200 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr122REQUIRES_VIOLATION [2021-10-24 11:09:13,200 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr123REQUIRES_VIOLATION [2021-10-24 11:09:13,200 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr124REQUIRES_VIOLATION [2021-10-24 11:09:13,200 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr125ASSERT_VIOLATIONMEMORY_FREE [2021-10-24 11:09:13,200 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr126ASSERT_VIOLATIONMEMORY_FREE [2021-10-24 11:09:13,200 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr127ASSERT_VIOLATIONMEMORY_FREE [2021-10-24 11:09:13,200 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr128ASSERT_VIOLATIONMEMORY_LEAK [2021-10-24 11:09:13,225 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397c4bc2-793d-47a2-8c40-75596478889c/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-10-24 11:09:13,401 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397c4bc2-793d-47a2-8c40-75596478889c/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-24 11:09:13,412 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-24 11:09:13,420 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 11:09:13 BoogieIcfgContainer [2021-10-24 11:09:13,420 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-24 11:09:13,421 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-24 11:09:13,421 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-24 11:09:13,421 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-24 11:09:13,421 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:00:39" (3/4) ... [2021-10-24 11:09:13,423 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-10-24 11:09:13,427 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure dll_create_slave [2021-10-24 11:09:13,427 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ##fun~$Pointer$~TO~VOID [2021-10-24 11:09:13,427 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure dll_insert_master [2021-10-24 11:09:13,427 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure dll_create_generic [2021-10-24 11:09:13,442 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 26 nodes and edges [2021-10-24 11:09:13,443 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2021-10-24 11:09:13,443 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2021-10-24 11:09:13,443 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-10-24 11:09:13,522 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397c4bc2-793d-47a2-8c40-75596478889c/bin/utaipan-9zjyvhn0QE/witness.graphml [2021-10-24 11:09:13,522 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-24 11:09:13,523 INFO L168 Benchmark]: Toolchain (without parser) took 516744.55 ms. Allocated memory was 86.0 MB in the beginning and 408.9 MB in the end (delta: 323.0 MB). Free memory was 45.8 MB in the beginning and 264.0 MB in the end (delta: -218.3 MB). Peak memory consumption was 103.2 MB. Max. memory is 16.1 GB. [2021-10-24 11:09:13,523 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 86.0 MB. Free memory is still 63.3 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-24 11:09:13,524 INFO L168 Benchmark]: CACSL2BoogieTranslator took 636.99 ms. Allocated memory was 86.0 MB in the beginning and 104.9 MB in the end (delta: 18.9 MB). Free memory was 45.6 MB in the beginning and 69.6 MB in the end (delta: -24.0 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-10-24 11:09:13,524 INFO L168 Benchmark]: Boogie Procedure Inliner took 109.28 ms. Allocated memory is still 104.9 MB. Free memory was 69.6 MB in the beginning and 66.2 MB in the end (delta: 3.3 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-24 11:09:13,525 INFO L168 Benchmark]: Boogie Preprocessor took 55.20 ms. Allocated memory is still 104.9 MB. Free memory was 66.2 MB in the beginning and 62.4 MB in the end (delta: 3.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-24 11:09:13,525 INFO L168 Benchmark]: RCFGBuilder took 1423.24 ms. Allocated memory is still 104.9 MB. Free memory was 62.4 MB in the beginning and 44.9 MB in the end (delta: 17.5 MB). Peak memory consumption was 30.3 MB. Max. memory is 16.1 GB. [2021-10-24 11:09:13,525 INFO L168 Benchmark]: TraceAbstraction took 514411.11 ms. Allocated memory was 104.9 MB in the beginning and 408.9 MB in the end (delta: 304.1 MB). Free memory was 44.4 MB in the beginning and 268.7 MB in the end (delta: -224.3 MB). Peak memory consumption was 79.3 MB. Max. memory is 16.1 GB. [2021-10-24 11:09:13,526 INFO L168 Benchmark]: Witness Printer took 101.37 ms. Allocated memory is still 408.9 MB. Free memory was 268.7 MB in the beginning and 264.0 MB in the end (delta: 4.7 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-24 11:09:13,529 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.24 ms. Allocated memory is still 86.0 MB. Free memory is still 63.3 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 636.99 ms. Allocated memory was 86.0 MB in the beginning and 104.9 MB in the end (delta: 18.9 MB). Free memory was 45.6 MB in the beginning and 69.6 MB in the end (delta: -24.0 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 109.28 ms. Allocated memory is still 104.9 MB. Free memory was 69.6 MB in the beginning and 66.2 MB in the end (delta: 3.3 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 55.20 ms. Allocated memory is still 104.9 MB. Free memory was 66.2 MB in the beginning and 62.4 MB in the end (delta: 3.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1423.24 ms. Allocated memory is still 104.9 MB. Free memory was 62.4 MB in the beginning and 44.9 MB in the end (delta: 17.5 MB). Peak memory consumption was 30.3 MB. Max. memory is 16.1 GB. * TraceAbstraction took 514411.11 ms. Allocated memory was 104.9 MB in the beginning and 408.9 MB in the end (delta: 304.1 MB). Free memory was 44.4 MB in the beginning and 268.7 MB in the end (delta: -224.3 MB). Peak memory consumption was 79.3 MB. Max. memory is 16.1 GB. * Witness Printer took 101.37 ms. Allocated memory is still 408.9 MB. Free memory was 268.7 MB in the beginning and 264.0 MB in the end (delta: 4.7 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 558]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 558]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 559]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 559]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 580]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 580]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 581]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 581]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 583]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 583]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 584]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 584]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 572]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 572]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 573]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 573]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 574]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 574]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 632]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 632]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 633]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 633]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 635]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 635]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 636]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 636]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 637]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 637]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 593]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 593]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 646]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 646]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 647]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 647]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 648]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 648]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 649]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 649]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 650]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 650]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 650]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 650]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 651]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 651]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 651]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 651]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 648]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 648]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 658]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 658]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 660]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 660]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 661]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 661]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 662]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 662]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 663]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 663]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 664]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 664]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 664]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 664]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 665]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 665]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 665]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 665]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 662]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 662]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 657]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 657]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 610]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 610]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 602]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 602]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 603]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 603]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 603]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 611]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 611]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 646]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 646]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 647]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 647]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 648]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 648]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 649]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 649]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 650]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 650]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 650]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 650]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 651]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 651]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 651]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 651]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 648]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 648]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 673]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 673]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 672]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 672]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 617]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 617]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 618]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 618]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 646]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 646]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 647]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 647]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 648]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 648]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 649]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 649]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 650]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 650]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 650]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 650]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 651]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 651]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 651]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 651]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 648]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 648]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 679]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 679]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 678]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 678]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 624]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 624]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 625]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 625]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 625]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 681]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 342 locations, 159 error locations. Started 1 CEGAR loops. OverallTime: 514329.2ms, OverallIterations: 20, TraceHistogramMax: 3, EmptinessCheckTime: 33.1ms, AutomataDifference: 252181.9ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 19.5ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 6384 SDtfs, 807 SDslu, 27498 SDs, 0 SdLazy, 13404 SolverSat, 390 SolverUnsat, 40 SolverUnknown, 0 SolverNotchecked, 91737.9ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 554 GetRequests, 274 SyntacticMatches, 3 SemanticMatches, 277 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 2230 ImplicationChecksByTransitivity, 340490.6ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=370occurred in iteration=15, InterpolantAutomatonStates: 159, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 329.6ms AutomataMinimizationTime, 20 MinimizatonAttempts, 45 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 177.0ms SsaConstructionTime, 743.4ms SatisfiabilityAnalysisTime, 258693.3ms InterpolantComputationTime, 600 NumberOfCodeBlocks, 600 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 739 ConstructedInterpolants, 108 QuantifiedInterpolants, 11130 SizeOfPredicates, 98 NumberOfNonLiveVariables, 1546 ConjunctsInSsa, 203 ConjunctsInUnsatCore, 28 InterpolantComputations, 16 PerfectInterpolantSequences, 125/210 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 - AllSpecificationsHoldResult: All specifications hold 159 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2021-10-24 11:09:13,695 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397c4bc2-793d-47a2-8c40-75596478889c/bin/utaipan-9zjyvhn0QE/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...