./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../../sv-benchmarks/c/forester-heap/sll-optional-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 9ad7fb26 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc1e5e13-f6d7-4e20-b318-7689d922f6b5/bin/utaipan-aC7eJsxGYH/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc1e5e13-f6d7-4e20-b318-7689d922f6b5/bin/utaipan-aC7eJsxGYH/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc1e5e13-f6d7-4e20-b318-7689d922f6b5/bin/utaipan-aC7eJsxGYH/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc1e5e13-f6d7-4e20-b318-7689d922f6b5/bin/utaipan-aC7eJsxGYH/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/sll-optional-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc1e5e13-f6d7-4e20-b318-7689d922f6b5/bin/utaipan-aC7eJsxGYH/config/svcomp-MemCleanup-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc1e5e13-f6d7-4e20-b318-7689d922f6b5/bin/utaipan-aC7eJsxGYH --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 88a09c8f9046119952ab983278979c8bac528a0f4e69aababe99c00b4eccdca0 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-9ad7fb2 [2021-11-03 04:07:35,473 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-03 04:07:35,475 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-03 04:07:35,516 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-03 04:07:35,517 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-03 04:07:35,518 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-03 04:07:35,520 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-03 04:07:35,522 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-03 04:07:35,525 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-03 04:07:35,526 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-03 04:07:35,527 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-03 04:07:35,529 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-03 04:07:35,529 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-03 04:07:35,531 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-03 04:07:35,532 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-03 04:07:35,534 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-03 04:07:35,535 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-03 04:07:35,537 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-03 04:07:35,539 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-03 04:07:35,542 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-03 04:07:35,544 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-03 04:07:35,549 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-03 04:07:35,552 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-03 04:07:35,553 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-03 04:07:35,558 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-03 04:07:35,569 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-03 04:07:35,569 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-03 04:07:35,571 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-03 04:07:35,571 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-03 04:07:35,572 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-03 04:07:35,573 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-03 04:07:35,574 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-03 04:07:35,575 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-03 04:07:35,575 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-03 04:07:35,577 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-03 04:07:35,577 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-03 04:07:35,578 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-03 04:07:35,578 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-03 04:07:35,579 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-03 04:07:35,580 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-03 04:07:35,581 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-03 04:07:35,582 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc1e5e13-f6d7-4e20-b318-7689d922f6b5/bin/utaipan-aC7eJsxGYH/config/svcomp-MemCleanup-32bit-Taipan_Default.epf [2021-11-03 04:07:35,606 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-03 04:07:35,607 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-03 04:07:35,608 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-03 04:07:35,608 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-03 04:07:35,608 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-03 04:07:35,609 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-03 04:07:35,609 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-03 04:07:35,610 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-03 04:07:35,610 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-03 04:07:35,610 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-03 04:07:35,611 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-03 04:07:35,611 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-03 04:07:35,612 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-03 04:07:35,612 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-03 04:07:35,612 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-11-03 04:07:35,613 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-03 04:07:35,614 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-03 04:07:35,614 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-03 04:07:35,614 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-03 04:07:35,615 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-11-03 04:07:35,615 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-03 04:07:35,615 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-03 04:07:35,616 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-03 04:07:35,616 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-11-03 04:07:35,616 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-11-03 04:07:35,616 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-03 04:07:35,620 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-03 04:07:35,620 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-03 04:07:35,621 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-03 04:07:35,622 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-03 04:07:35,622 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-03 04:07:35,622 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-03 04:07:35,622 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-03 04:07:35,623 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-03 04:07:35,623 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-03 04:07:35,623 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-03 04:07:35,624 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-03 04:07:35,625 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-03 04:07:35,625 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_bc1e5e13-f6d7-4e20-b318-7689d922f6b5/bin/utaipan-aC7eJsxGYH/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_bc1e5e13-f6d7-4e20-b318-7689d922f6b5/bin/utaipan-aC7eJsxGYH 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 -> 88a09c8f9046119952ab983278979c8bac528a0f4e69aababe99c00b4eccdca0 [2021-11-03 04:07:35,875 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-03 04:07:35,897 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-03 04:07:35,900 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-03 04:07:35,901 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-03 04:07:35,902 INFO L275 PluginConnector]: CDTParser initialized [2021-11-03 04:07:35,903 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc1e5e13-f6d7-4e20-b318-7689d922f6b5/bin/utaipan-aC7eJsxGYH/../../sv-benchmarks/c/forester-heap/sll-optional-2.i [2021-11-03 04:07:35,959 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc1e5e13-f6d7-4e20-b318-7689d922f6b5/bin/utaipan-aC7eJsxGYH/data/474428284/8f6f8e6e7c844e1ab8c64cf102f15206/FLAGfcbddbc71 [2021-11-03 04:07:36,479 INFO L306 CDTParser]: Found 1 translation units. [2021-11-03 04:07:36,480 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc1e5e13-f6d7-4e20-b318-7689d922f6b5/sv-benchmarks/c/forester-heap/sll-optional-2.i [2021-11-03 04:07:36,493 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc1e5e13-f6d7-4e20-b318-7689d922f6b5/bin/utaipan-aC7eJsxGYH/data/474428284/8f6f8e6e7c844e1ab8c64cf102f15206/FLAGfcbddbc71 [2021-11-03 04:07:36,818 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc1e5e13-f6d7-4e20-b318-7689d922f6b5/bin/utaipan-aC7eJsxGYH/data/474428284/8f6f8e6e7c844e1ab8c64cf102f15206 [2021-11-03 04:07:36,820 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-03 04:07:36,822 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-03 04:07:36,824 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-03 04:07:36,824 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-03 04:07:36,827 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-03 04:07:36,828 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 04:07:36" (1/1) ... [2021-11-03 04:07:36,829 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c1b66af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:07:36, skipping insertion in model container [2021-11-03 04:07:36,830 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 04:07:36" (1/1) ... [2021-11-03 04:07:36,837 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-03 04:07:36,883 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-03 04:07:37,213 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_bc1e5e13-f6d7-4e20-b318-7689d922f6b5/sv-benchmarks/c/forester-heap/sll-optional-2.i[22641,22654] [2021-11-03 04:07:37,232 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-03 04:07:37,246 INFO L203 MainTranslator]: Completed pre-run [2021-11-03 04:07:37,320 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_bc1e5e13-f6d7-4e20-b318-7689d922f6b5/sv-benchmarks/c/forester-heap/sll-optional-2.i[22641,22654] [2021-11-03 04:07:37,331 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-03 04:07:37,356 INFO L208 MainTranslator]: Completed translation [2021-11-03 04:07:37,357 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:07:37 WrapperNode [2021-11-03 04:07:37,357 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-03 04:07:37,359 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-03 04:07:37,359 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-03 04:07:37,359 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-03 04:07:37,367 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:07:37" (1/1) ... [2021-11-03 04:07:37,380 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:07:37" (1/1) ... [2021-11-03 04:07:37,410 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-03 04:07:37,411 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-03 04:07:37,411 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-03 04:07:37,411 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-03 04:07:37,422 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:07:37" (1/1) ... [2021-11-03 04:07:37,422 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:07:37" (1/1) ... [2021-11-03 04:07:37,427 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:07:37" (1/1) ... [2021-11-03 04:07:37,428 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:07:37" (1/1) ... [2021-11-03 04:07:37,439 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:07:37" (1/1) ... [2021-11-03 04:07:37,444 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:07:37" (1/1) ... [2021-11-03 04:07:37,446 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:07:37" (1/1) ... [2021-11-03 04:07:37,450 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-03 04:07:37,451 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-03 04:07:37,451 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-03 04:07:37,451 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-03 04:07:37,452 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:07:37" (1/1) ... [2021-11-03 04:07:37,459 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-03 04:07:37,476 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc1e5e13-f6d7-4e20-b318-7689d922f6b5/bin/utaipan-aC7eJsxGYH/z3 [2021-11-03 04:07:37,489 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc1e5e13-f6d7-4e20-b318-7689d922f6b5/bin/utaipan-aC7eJsxGYH/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-03 04:07:37,492 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc1e5e13-f6d7-4e20-b318-7689d922f6b5/bin/utaipan-aC7eJsxGYH/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-03 04:07:37,535 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-03 04:07:37,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-03 04:07:37,535 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-03 04:07:37,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-03 04:07:37,536 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-03 04:07:37,536 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-03 04:07:37,536 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-03 04:07:37,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-03 04:07:37,537 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-03 04:07:37,537 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-03 04:07:38,328 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-03 04:07:38,329 INFO L299 CfgBuilder]: Removed 9 assume(true) statements. [2021-11-03 04:07:38,332 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 04:07:38 BoogieIcfgContainer [2021-11-03 04:07:38,333 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-03 04:07:38,337 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-03 04:07:38,337 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-03 04:07:38,340 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-03 04:07:38,340 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 04:07:36" (1/3) ... [2021-11-03 04:07:38,341 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f22624a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 04:07:38, skipping insertion in model container [2021-11-03 04:07:38,341 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:07:37" (2/3) ... [2021-11-03 04:07:38,341 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f22624a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 04:07:38, skipping insertion in model container [2021-11-03 04:07:38,342 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 04:07:38" (3/3) ... [2021-11-03 04:07:38,343 INFO L111 eAbstractionObserver]: Analyzing ICFG sll-optional-2.i [2021-11-03 04:07:38,347 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-03 04:07:38,348 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 60 error locations. [2021-11-03 04:07:38,392 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-03 04:07:38,398 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-11-03 04:07:38,399 INFO L340 AbstractCegarLoop]: Starting to check reachability of 60 error locations. [2021-11-03 04:07:38,415 INFO L276 IsEmpty]: Start isEmpty. Operand has 110 states, 49 states have (on average 2.489795918367347) internal successors, (122), 109 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:07:38,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2021-11-03 04:07:38,421 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:07:38,422 INFO L513 BasicCegarLoop]: trace histogram [1, 1] [2021-11-03 04:07:38,422 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 56 more)] === [2021-11-03 04:07:38,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:07:38,428 INFO L85 PathProgramCache]: Analyzing trace with hash 7413, now seen corresponding path program 1 times [2021-11-03 04:07:38,438 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:07:38,438 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875345505] [2021-11-03 04:07:38,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:07:38,440 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:07:38,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:07:38,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 04:07:38,573 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 04:07:38,573 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875345505] [2021-11-03 04:07:38,574 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875345505] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:07:38,574 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:07:38,575 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-11-03 04:07:38,576 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282911710] [2021-11-03 04:07:38,581 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-03 04:07:38,582 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 04:07:38,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-03 04:07:38,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-03 04:07:38,598 INFO L87 Difference]: Start difference. First operand has 110 states, 49 states have (on average 2.489795918367347) internal successors, (122), 109 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:07:38,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:07:38,769 INFO L93 Difference]: Finished difference Result 110 states and 118 transitions. [2021-11-03 04:07:38,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-03 04:07:38,771 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2021-11-03 04:07:38,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:07:38,782 INFO L225 Difference]: With dead ends: 110 [2021-11-03 04:07:38,782 INFO L226 Difference]: Without dead ends: 108 [2021-11-03 04:07:38,784 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-03 04:07:38,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2021-11-03 04:07:38,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 103. [2021-11-03 04:07:38,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 52 states have (on average 2.173076923076923) internal successors, (113), 102 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:07:38,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 113 transitions. [2021-11-03 04:07:38,824 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 113 transitions. Word has length 2 [2021-11-03 04:07:38,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:07:38,825 INFO L470 AbstractCegarLoop]: Abstraction has 103 states and 113 transitions. [2021-11-03 04:07:38,825 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:07:38,825 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 113 transitions. [2021-11-03 04:07:38,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2021-11-03 04:07:38,826 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:07:38,826 INFO L513 BasicCegarLoop]: trace histogram [1, 1] [2021-11-03 04:07:38,826 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-03 04:07:38,827 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 56 more)] === [2021-11-03 04:07:38,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:07:38,828 INFO L85 PathProgramCache]: Analyzing trace with hash 7414, now seen corresponding path program 1 times [2021-11-03 04:07:38,828 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:07:38,828 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991637376] [2021-11-03 04:07:38,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:07:38,829 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:07:38,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:07:38,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 04:07:38,876 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 04:07:38,876 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991637376] [2021-11-03 04:07:38,876 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991637376] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:07:38,877 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:07:38,877 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-11-03 04:07:38,877 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312155551] [2021-11-03 04:07:38,878 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-03 04:07:38,879 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 04:07:38,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-03 04:07:38,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-03 04:07:38,880 INFO L87 Difference]: Start difference. First operand 103 states and 113 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:07:39,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:07:39,029 INFO L93 Difference]: Finished difference Result 98 states and 108 transitions. [2021-11-03 04:07:39,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-03 04:07:39,029 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2021-11-03 04:07:39,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:07:39,032 INFO L225 Difference]: With dead ends: 98 [2021-11-03 04:07:39,034 INFO L226 Difference]: Without dead ends: 98 [2021-11-03 04:07:39,035 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-03 04:07:39,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2021-11-03 04:07:39,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 95. [2021-11-03 04:07:39,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 52 states have (on average 2.019230769230769) internal successors, (105), 94 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:07:39,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 105 transitions. [2021-11-03 04:07:39,054 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 105 transitions. Word has length 2 [2021-11-03 04:07:39,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:07:39,055 INFO L470 AbstractCegarLoop]: Abstraction has 95 states and 105 transitions. [2021-11-03 04:07:39,055 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:07:39,055 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 105 transitions. [2021-11-03 04:07:39,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-11-03 04:07:39,056 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:07:39,057 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-11-03 04:07:39,059 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-03 04:07:39,060 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 56 more)] === [2021-11-03 04:07:39,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:07:39,061 INFO L85 PathProgramCache]: Analyzing trace with hash -845954935, now seen corresponding path program 1 times [2021-11-03 04:07:39,062 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:07:39,063 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506929201] [2021-11-03 04:07:39,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:07:39,063 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:07:39,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:07:39,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 04:07:39,188 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 04:07:39,188 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506929201] [2021-11-03 04:07:39,189 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506929201] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:07:39,189 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:07:39,190 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-03 04:07:39,190 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119421306] [2021-11-03 04:07:39,190 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-03 04:07:39,191 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 04:07:39,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-03 04:07:39,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-03 04:07:39,192 INFO L87 Difference]: Start difference. First operand 95 states and 105 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:07:39,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:07:39,422 INFO L93 Difference]: Finished difference Result 119 states and 132 transitions. [2021-11-03 04:07:39,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-03 04:07:39,423 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-11-03 04:07:39,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:07:39,428 INFO L225 Difference]: With dead ends: 119 [2021-11-03 04:07:39,428 INFO L226 Difference]: Without dead ends: 119 [2021-11-03 04:07:39,428 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-03 04:07:39,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2021-11-03 04:07:39,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 94. [2021-11-03 04:07:39,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 52 states have (on average 2.0) internal successors, (104), 93 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:07:39,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 104 transitions. [2021-11-03 04:07:39,446 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 104 transitions. Word has length 7 [2021-11-03 04:07:39,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:07:39,447 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 104 transitions. [2021-11-03 04:07:39,447 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:07:39,447 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 104 transitions. [2021-11-03 04:07:39,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-11-03 04:07:39,448 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:07:39,448 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-11-03 04:07:39,448 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-03 04:07:39,448 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 56 more)] === [2021-11-03 04:07:39,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:07:39,449 INFO L85 PathProgramCache]: Analyzing trace with hash -845954934, now seen corresponding path program 1 times [2021-11-03 04:07:39,449 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:07:39,450 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513361645] [2021-11-03 04:07:39,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:07:39,450 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:07:39,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:07:39,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 04:07:39,605 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 04:07:39,605 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513361645] [2021-11-03 04:07:39,605 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513361645] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:07:39,605 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:07:39,606 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-03 04:07:39,606 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084807431] [2021-11-03 04:07:39,606 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-03 04:07:39,606 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 04:07:39,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-03 04:07:39,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-03 04:07:39,608 INFO L87 Difference]: Start difference. First operand 94 states and 104 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:07:39,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:07:39,799 INFO L93 Difference]: Finished difference Result 93 states and 103 transitions. [2021-11-03 04:07:39,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-03 04:07:39,800 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-11-03 04:07:39,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:07:39,801 INFO L225 Difference]: With dead ends: 93 [2021-11-03 04:07:39,801 INFO L226 Difference]: Without dead ends: 93 [2021-11-03 04:07:39,801 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-03 04:07:39,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2021-11-03 04:07:39,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2021-11-03 04:07:39,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 52 states have (on average 1.9807692307692308) internal successors, (103), 92 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:07:39,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 103 transitions. [2021-11-03 04:07:39,808 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 103 transitions. Word has length 7 [2021-11-03 04:07:39,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:07:39,808 INFO L470 AbstractCegarLoop]: Abstraction has 93 states and 103 transitions. [2021-11-03 04:07:39,808 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:07:39,809 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 103 transitions. [2021-11-03 04:07:39,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-03 04:07:39,809 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:07:39,809 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 04:07:39,810 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-03 04:07:39,810 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 56 more)] === [2021-11-03 04:07:39,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:07:39,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1318111834, now seen corresponding path program 1 times [2021-11-03 04:07:39,811 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:07:39,811 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035119431] [2021-11-03 04:07:39,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:07:39,812 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:07:39,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:07:39,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 04:07:39,869 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 04:07:39,869 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035119431] [2021-11-03 04:07:39,869 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035119431] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:07:39,870 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:07:39,870 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-03 04:07:39,870 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267266244] [2021-11-03 04:07:39,871 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-03 04:07:39,871 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 04:07:39,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-03 04:07:39,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-03 04:07:39,872 INFO L87 Difference]: Start difference. First operand 93 states and 103 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:07:40,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:07:40,009 INFO L93 Difference]: Finished difference Result 94 states and 103 transitions. [2021-11-03 04:07:40,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-03 04:07:40,010 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-11-03 04:07:40,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:07:40,011 INFO L225 Difference]: With dead ends: 94 [2021-11-03 04:07:40,011 INFO L226 Difference]: Without dead ends: 94 [2021-11-03 04:07:40,011 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-03 04:07:40,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2021-11-03 04:07:40,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 87. [2021-11-03 04:07:40,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 57 states have (on average 1.7894736842105263) internal successors, (102), 86 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:07:40,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 102 transitions. [2021-11-03 04:07:40,016 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 102 transitions. Word has length 10 [2021-11-03 04:07:40,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:07:40,017 INFO L470 AbstractCegarLoop]: Abstraction has 87 states and 102 transitions. [2021-11-03 04:07:40,017 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:07:40,017 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 102 transitions. [2021-11-03 04:07:40,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-03 04:07:40,017 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:07:40,018 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 04:07:40,018 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-03 04:07:40,018 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 56 more)] === [2021-11-03 04:07:40,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:07:40,018 INFO L85 PathProgramCache]: Analyzing trace with hash 1318111835, now seen corresponding path program 1 times [2021-11-03 04:07:40,019 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:07:40,019 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263188123] [2021-11-03 04:07:40,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:07:40,019 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:07:40,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:07:40,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 04:07:40,095 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 04:07:40,096 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263188123] [2021-11-03 04:07:40,096 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263188123] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:07:40,096 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:07:40,096 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-03 04:07:40,097 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661460006] [2021-11-03 04:07:40,097 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-03 04:07:40,097 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 04:07:40,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-03 04:07:40,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-03 04:07:40,098 INFO L87 Difference]: Start difference. First operand 87 states and 102 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:07:40,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:07:40,267 INFO L93 Difference]: Finished difference Result 120 states and 135 transitions. [2021-11-03 04:07:40,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-03 04:07:40,268 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-11-03 04:07:40,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:07:40,269 INFO L225 Difference]: With dead ends: 120 [2021-11-03 04:07:40,269 INFO L226 Difference]: Without dead ends: 120 [2021-11-03 04:07:40,269 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-03 04:07:40,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2021-11-03 04:07:40,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 103. [2021-11-03 04:07:40,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 73 states have (on average 1.6712328767123288) internal successors, (122), 102 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:07:40,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 122 transitions. [2021-11-03 04:07:40,287 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 122 transitions. Word has length 10 [2021-11-03 04:07:40,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:07:40,287 INFO L470 AbstractCegarLoop]: Abstraction has 103 states and 122 transitions. [2021-11-03 04:07:40,288 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:07:40,288 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 122 transitions. [2021-11-03 04:07:40,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-03 04:07:40,288 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:07:40,289 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 04:07:40,289 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-03 04:07:40,289 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 56 more)] === [2021-11-03 04:07:40,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:07:40,290 INFO L85 PathProgramCache]: Analyzing trace with hash -309722580, now seen corresponding path program 1 times [2021-11-03 04:07:40,290 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:07:40,290 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768076827] [2021-11-03 04:07:40,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:07:40,290 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:07:40,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:07:40,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 04:07:40,336 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 04:07:40,336 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768076827] [2021-11-03 04:07:40,336 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768076827] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:07:40,336 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:07:40,336 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-03 04:07:40,337 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738330607] [2021-11-03 04:07:40,337 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-03 04:07:40,337 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 04:07:40,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-03 04:07:40,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-03 04:07:40,338 INFO L87 Difference]: Start difference. First operand 103 states and 122 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:07:40,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:07:40,472 INFO L93 Difference]: Finished difference Result 103 states and 122 transitions. [2021-11-03 04:07:40,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-03 04:07:40,473 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-11-03 04:07:40,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:07:40,474 INFO L225 Difference]: With dead ends: 103 [2021-11-03 04:07:40,474 INFO L226 Difference]: Without dead ends: 103 [2021-11-03 04:07:40,474 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-11-03 04:07:40,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2021-11-03 04:07:40,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2021-11-03 04:07:40,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 73 states have (on average 1.6575342465753424) internal successors, (121), 101 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:07:40,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 121 transitions. [2021-11-03 04:07:40,479 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 121 transitions. Word has length 12 [2021-11-03 04:07:40,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:07:40,479 INFO L470 AbstractCegarLoop]: Abstraction has 102 states and 121 transitions. [2021-11-03 04:07:40,480 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:07:40,480 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 121 transitions. [2021-11-03 04:07:40,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-03 04:07:40,480 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:07:40,480 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 04:07:40,481 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-03 04:07:40,481 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 56 more)] === [2021-11-03 04:07:40,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:07:40,481 INFO L85 PathProgramCache]: Analyzing trace with hash -309722579, now seen corresponding path program 1 times [2021-11-03 04:07:40,481 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:07:40,482 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924854918] [2021-11-03 04:07:40,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:07:40,482 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:07:40,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:07:40,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 04:07:40,606 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 04:07:40,606 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924854918] [2021-11-03 04:07:40,606 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924854918] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:07:40,606 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:07:40,606 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-03 04:07:40,607 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812509253] [2021-11-03 04:07:40,607 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-03 04:07:40,607 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 04:07:40,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-03 04:07:40,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-03 04:07:40,608 INFO L87 Difference]: Start difference. First operand 102 states and 121 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:07:40,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:07:40,759 INFO L93 Difference]: Finished difference Result 93 states and 112 transitions. [2021-11-03 04:07:40,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-03 04:07:40,760 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-11-03 04:07:40,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:07:40,761 INFO L225 Difference]: With dead ends: 93 [2021-11-03 04:07:40,761 INFO L226 Difference]: Without dead ends: 93 [2021-11-03 04:07:40,761 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-11-03 04:07:40,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2021-11-03 04:07:40,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 88. [2021-11-03 04:07:40,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 69 states have (on average 1.536231884057971) internal successors, (106), 87 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:07:40,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 106 transitions. [2021-11-03 04:07:40,765 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 106 transitions. Word has length 12 [2021-11-03 04:07:40,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:07:40,765 INFO L470 AbstractCegarLoop]: Abstraction has 88 states and 106 transitions. [2021-11-03 04:07:40,765 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:07:40,765 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 106 transitions. [2021-11-03 04:07:40,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-03 04:07:40,766 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:07:40,766 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 04:07:40,766 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-03 04:07:40,767 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 56 more)] === [2021-11-03 04:07:40,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:07:40,767 INFO L85 PathProgramCache]: Analyzing trace with hash -1016417189, now seen corresponding path program 1 times [2021-11-03 04:07:40,767 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:07:40,767 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935390796] [2021-11-03 04:07:40,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:07:40,768 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:07:40,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:07:40,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 04:07:40,839 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 04:07:40,839 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935390796] [2021-11-03 04:07:40,839 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935390796] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:07:40,841 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:07:40,841 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-03 04:07:40,841 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857838337] [2021-11-03 04:07:40,841 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-03 04:07:40,844 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 04:07:40,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-03 04:07:40,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-03 04:07:40,845 INFO L87 Difference]: Start difference. First operand 88 states and 106 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:07:40,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:07:40,932 INFO L93 Difference]: Finished difference Result 106 states and 121 transitions. [2021-11-03 04:07:40,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-03 04:07:40,932 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-11-03 04:07:40,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:07:40,933 INFO L225 Difference]: With dead ends: 106 [2021-11-03 04:07:40,933 INFO L226 Difference]: Without dead ends: 106 [2021-11-03 04:07:40,934 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-03 04:07:40,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2021-11-03 04:07:40,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 88. [2021-11-03 04:07:40,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 69 states have (on average 1.5072463768115942) internal successors, (104), 87 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:07:40,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 104 transitions. [2021-11-03 04:07:40,937 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 104 transitions. Word has length 13 [2021-11-03 04:07:40,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:07:40,937 INFO L470 AbstractCegarLoop]: Abstraction has 88 states and 104 transitions. [2021-11-03 04:07:40,938 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:07:40,938 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 104 transitions. [2021-11-03 04:07:40,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-03 04:07:40,938 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:07:40,938 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 04:07:40,939 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-03 04:07:40,939 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 56 more)] === [2021-11-03 04:07:40,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:07:40,939 INFO L85 PathProgramCache]: Analyzing trace with hash -1916789186, now seen corresponding path program 1 times [2021-11-03 04:07:40,939 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:07:40,940 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115649756] [2021-11-03 04:07:40,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:07:40,940 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:07:40,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-03 04:07:40,954 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-03 04:07:40,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-03 04:07:40,988 INFO L133 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2021-11-03 04:07:40,988 INFO L627 BasicCegarLoop]: Counterexample is feasible [2021-11-03 04:07:40,989 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK [2021-11-03 04:07:40,991 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATION [2021-11-03 04:07:40,991 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATION [2021-11-03 04:07:40,991 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATION [2021-11-03 04:07:40,992 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATION [2021-11-03 04:07:40,992 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATION [2021-11-03 04:07:40,992 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATION [2021-11-03 04:07:40,992 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATION [2021-11-03 04:07:40,992 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATION [2021-11-03 04:07:40,992 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATION [2021-11-03 04:07:40,993 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATION [2021-11-03 04:07:40,993 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATION [2021-11-03 04:07:40,993 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATION [2021-11-03 04:07:40,993 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATION [2021-11-03 04:07:40,993 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATION [2021-11-03 04:07:40,993 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATION [2021-11-03 04:07:40,994 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATION [2021-11-03 04:07:40,994 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATION [2021-11-03 04:07:40,994 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATION [2021-11-03 04:07:40,994 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATION [2021-11-03 04:07:40,994 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATION [2021-11-03 04:07:40,995 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATION [2021-11-03 04:07:40,995 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATION [2021-11-03 04:07:40,995 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATION [2021-11-03 04:07:40,995 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATION [2021-11-03 04:07:40,995 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATION [2021-11-03 04:07:40,995 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATION [2021-11-03 04:07:40,996 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATION [2021-11-03 04:07:40,996 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATION [2021-11-03 04:07:40,996 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATION [2021-11-03 04:07:40,996 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATION [2021-11-03 04:07:40,996 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATION [2021-11-03 04:07:40,996 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATION [2021-11-03 04:07:40,997 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATION [2021-11-03 04:07:40,997 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATION [2021-11-03 04:07:40,997 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATION [2021-11-03 04:07:40,997 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATION [2021-11-03 04:07:40,997 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATION [2021-11-03 04:07:40,997 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATION [2021-11-03 04:07:40,998 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38REQUIRES_VIOLATION [2021-11-03 04:07:40,998 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39REQUIRES_VIOLATION [2021-11-03 04:07:40,998 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40REQUIRES_VIOLATION [2021-11-03 04:07:40,998 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41REQUIRES_VIOLATION [2021-11-03 04:07:40,998 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42REQUIRES_VIOLATION [2021-11-03 04:07:40,999 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43REQUIRES_VIOLATION [2021-11-03 04:07:40,999 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45REQUIRES_VIOLATION [2021-11-03 04:07:40,999 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46REQUIRES_VIOLATION [2021-11-03 04:07:40,999 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47REQUIRES_VIOLATION [2021-11-03 04:07:40,999 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48REQUIRES_VIOLATION [2021-11-03 04:07:40,999 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49REQUIRES_VIOLATION [2021-11-03 04:07:41,000 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50REQUIRES_VIOLATION [2021-11-03 04:07:41,000 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51REQUIRES_VIOLATION [2021-11-03 04:07:41,000 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52REQUIRES_VIOLATION [2021-11-03 04:07:41,000 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE [2021-11-03 04:07:41,000 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE [2021-11-03 04:07:41,001 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE [2021-11-03 04:07:41,001 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE [2021-11-03 04:07:41,001 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE [2021-11-03 04:07:41,001 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE [2021-11-03 04:07:41,002 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_LEAK [2021-11-03 04:07:41,002 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-03 04:07:41,005 INFO L731 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 04:07:41,009 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-03 04:07:41,035 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.11 04:07:41 BoogieIcfgContainer [2021-11-03 04:07:41,035 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-03 04:07:41,035 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-03 04:07:41,035 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-03 04:07:41,036 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-03 04:07:41,036 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 04:07:38" (3/4) ... [2021-11-03 04:07:41,038 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-11-03 04:07:41,078 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc1e5e13-f6d7-4e20-b318-7689d922f6b5/bin/utaipan-aC7eJsxGYH/witness.graphml [2021-11-03 04:07:41,079 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-03 04:07:41,080 INFO L168 Benchmark]: Toolchain (without parser) took 4257.41 ms. Allocated memory was 125.8 MB in the beginning and 159.4 MB in the end (delta: 33.6 MB). Free memory was 83.3 MB in the beginning and 81.4 MB in the end (delta: 1.9 MB). Peak memory consumption was 34.4 MB. Max. memory is 16.1 GB. [2021-11-03 04:07:41,081 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 125.8 MB. Free memory was 101.2 MB in the beginning and 101.2 MB in the end (delta: 56.0 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-11-03 04:07:41,081 INFO L168 Benchmark]: CACSL2BoogieTranslator took 534.00 ms. Allocated memory is still 125.8 MB. Free memory was 83.0 MB in the beginning and 93.8 MB in the end (delta: -10.7 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-11-03 04:07:41,082 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.95 ms. Allocated memory is still 125.8 MB. Free memory was 93.8 MB in the beginning and 91.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-11-03 04:07:41,082 INFO L168 Benchmark]: Boogie Preprocessor took 38.91 ms. Allocated memory is still 125.8 MB. Free memory was 91.7 MB in the beginning and 89.8 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-11-03 04:07:41,083 INFO L168 Benchmark]: RCFGBuilder took 882.08 ms. Allocated memory is still 125.8 MB. Free memory was 89.8 MB in the beginning and 64.0 MB in the end (delta: 25.8 MB). Peak memory consumption was 25.2 MB. Max. memory is 16.1 GB. [2021-11-03 04:07:41,083 INFO L168 Benchmark]: TraceAbstraction took 2698.28 ms. Allocated memory was 125.8 MB in the beginning and 159.4 MB in the end (delta: 33.6 MB). Free memory was 63.7 MB in the beginning and 83.5 MB in the end (delta: -19.8 MB). Peak memory consumption was 15.6 MB. Max. memory is 16.1 GB. [2021-11-03 04:07:41,084 INFO L168 Benchmark]: Witness Printer took 43.42 ms. Allocated memory is still 159.4 MB. Free memory was 82.4 MB in the beginning and 81.4 MB in the end (delta: 1.0 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-11-03 04:07:41,086 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.23 ms. Allocated memory is still 125.8 MB. Free memory was 101.2 MB in the beginning and 101.2 MB in the end (delta: 56.0 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 534.00 ms. Allocated memory is still 125.8 MB. Free memory was 83.0 MB in the beginning and 93.8 MB in the end (delta: -10.7 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 51.95 ms. Allocated memory is still 125.8 MB. Free memory was 93.8 MB in the beginning and 91.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 38.91 ms. Allocated memory is still 125.8 MB. Free memory was 91.7 MB in the beginning and 89.8 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 882.08 ms. Allocated memory is still 125.8 MB. Free memory was 89.8 MB in the beginning and 64.0 MB in the end (delta: 25.8 MB). Peak memory consumption was 25.2 MB. Max. memory is 16.1 GB. * TraceAbstraction took 2698.28 ms. Allocated memory was 125.8 MB in the beginning and 159.4 MB in the end (delta: 33.6 MB). Free memory was 63.7 MB in the beginning and 83.5 MB in the end (delta: -19.8 MB). Peak memory consumption was 15.6 MB. Max. memory is 16.1 GB. * Witness Printer took 43.42 ms. Allocated memory is still 159.4 MB. Free memory was 82.4 MB in the beginning and 81.4 MB in the end (delta: 1.0 MB). There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 1007]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L996] SLL* head = malloc(sizeof(SLL)); [L997] head->next = ((void*)0) [L998] COND FALSE !(__VERIFIER_nondet_int()) [L998] COND FALSE !(__VERIFIER_nondet_int()) [L998] head->data = 0 [L998] head->opt = head [L999] SLL* x = head; [L1001] COND FALSE !(__VERIFIER_nondet_int()) [L1004] x = head [L1005] COND TRUE x != ((void*)0) [L1007] EXPR x->data [L1007] EXPR x->data == 2 && x->opt == x [L1007] COND TRUE !(x->data == 2 && x->opt == x) [L1007] reach_error() - UnprovableResult [Line: 997]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 997]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 998]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 998]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 998]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 998]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 998]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 998]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 998]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 998]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 998]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 998]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 998]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 998]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 998]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 998]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 998]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 998]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1001]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1001]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1001]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1001]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1001]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1001]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1001]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1001]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1001]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1001]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1001]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1001]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1001]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1001]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1001]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1001]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1001]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1001]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1001]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1001]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1001]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1001]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1007]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1007]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1007]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1007]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1008]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1008]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1017]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1017]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1018]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1018]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1018]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1018]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1018]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1019]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1019]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1019]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 993]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 110 locations, 60 error locations. Started 1 CEGAR loops. OverallTime: 2.6s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 531 SDtfs, 540 SDslu, 595 SDs, 0 SdLazy, 1037 SolverSat, 105 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 37 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=110occurred in iteration=0, InterpolantAutomatonStates: 41, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 81 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 90 NumberOfCodeBlocks, 90 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 66 ConstructedInterpolants, 0 QuantifiedInterpolants, 318 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-11-03 04:07:41,122 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc1e5e13-f6d7-4e20-b318-7689d922f6b5/bin/utaipan-aC7eJsxGYH/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-memcleanup)