./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/verifythis/elimination_max_rec.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 7b2dab56 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a622b0d-f870-4066-9a21-c342cd33e622/bin/utaipan-WLngWcDbfI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a622b0d-f870-4066-9a21-c342cd33e622/bin/utaipan-WLngWcDbfI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a622b0d-f870-4066-9a21-c342cd33e622/bin/utaipan-WLngWcDbfI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a622b0d-f870-4066-9a21-c342cd33e622/bin/utaipan-WLngWcDbfI/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/verifythis/elimination_max_rec.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a622b0d-f870-4066-9a21-c342cd33e622/bin/utaipan-WLngWcDbfI/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a622b0d-f870-4066-9a21-c342cd33e622/bin/utaipan-WLngWcDbfI --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7862960b0aa057ac19174563f251d134d1269c2b ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.0-7b2dab5 [2021-10-11 02:26:04,908 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-11 02:26:04,911 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-11 02:26:04,961 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-11 02:26:04,962 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-11 02:26:04,966 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-11 02:26:04,969 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-11 02:26:04,973 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-11 02:26:04,976 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-11 02:26:04,981 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-11 02:26:04,983 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-11 02:26:04,984 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-11 02:26:04,985 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-11 02:26:04,987 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-11 02:26:04,989 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-11 02:26:04,991 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-11 02:26:04,993 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-11 02:26:04,996 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-11 02:26:04,999 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-11 02:26:05,007 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-11 02:26:05,009 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-11 02:26:05,011 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-11 02:26:05,014 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-11 02:26:05,016 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-11 02:26:05,024 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-11 02:26:05,025 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-11 02:26:05,025 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-11 02:26:05,027 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-11 02:26:05,028 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-11 02:26:05,030 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-11 02:26:05,031 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-11 02:26:05,032 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-11 02:26:05,034 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-11 02:26:05,035 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-11 02:26:05,037 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-11 02:26:05,037 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-11 02:26:05,038 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-11 02:26:05,038 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-11 02:26:05,039 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-11 02:26:05,040 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-11 02:26:05,040 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-11 02:26:05,043 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a622b0d-f870-4066-9a21-c342cd33e622/bin/utaipan-WLngWcDbfI/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2021-10-11 02:26:05,086 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-11 02:26:05,086 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-11 02:26:05,088 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-10-11 02:26:05,094 INFO L138 SettingsManager]: * User list type=DISABLED [2021-10-11 02:26:05,095 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-10-11 02:26:05,095 INFO L138 SettingsManager]: * Explicit value domain=true [2021-10-11 02:26:05,095 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-10-11 02:26:05,096 INFO L138 SettingsManager]: * Octagon Domain=false [2021-10-11 02:26:05,096 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-10-11 02:26:05,096 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-10-11 02:26:05,097 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-10-11 02:26:05,097 INFO L138 SettingsManager]: * Interval Domain=false [2021-10-11 02:26:05,098 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-10-11 02:26:05,098 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-10-11 02:26:05,098 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-10-11 02:26:05,099 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-11 02:26:05,099 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-11 02:26:05,099 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-11 02:26:05,100 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-11 02:26:05,100 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-10-11 02:26:05,100 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-11 02:26:05,100 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-11 02:26:05,101 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-11 02:26:05,101 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-10-11 02:26:05,101 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-10-11 02:26:05,101 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-10-11 02:26:05,102 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-11 02:26:05,102 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-10-11 02:26:05,102 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-11 02:26:05,102 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-11 02:26:05,103 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-11 02:26:05,103 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-11 02:26:05,103 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-11 02:26:05,104 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-11 02:26:05,104 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-11 02:26:05,104 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-10-11 02:26:05,104 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-11 02:26:05,104 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-11 02:26:05,105 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-10-11 02:26:05,105 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_4a622b0d-f870-4066-9a21-c342cd33e622/bin/utaipan-WLngWcDbfI/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_4a622b0d-f870-4066-9a21-c342cd33e622/bin/utaipan-WLngWcDbfI 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-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 7862960b0aa057ac19174563f251d134d1269c2b [2021-10-11 02:26:05,421 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-11 02:26:05,450 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-11 02:26:05,454 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-11 02:26:05,455 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-11 02:26:05,456 INFO L275 PluginConnector]: CDTParser initialized [2021-10-11 02:26:05,457 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a622b0d-f870-4066-9a21-c342cd33e622/bin/utaipan-WLngWcDbfI/../../sv-benchmarks/c/verifythis/elimination_max_rec.c [2021-10-11 02:26:05,517 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a622b0d-f870-4066-9a21-c342cd33e622/bin/utaipan-WLngWcDbfI/data/23575a29a/45cad9977217432f92bf6428fb02306b/FLAGbf1cbd2cc [2021-10-11 02:26:05,934 INFO L306 CDTParser]: Found 1 translation units. [2021-10-11 02:26:05,935 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a622b0d-f870-4066-9a21-c342cd33e622/sv-benchmarks/c/verifythis/elimination_max_rec.c [2021-10-11 02:26:05,940 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a622b0d-f870-4066-9a21-c342cd33e622/bin/utaipan-WLngWcDbfI/data/23575a29a/45cad9977217432f92bf6428fb02306b/FLAGbf1cbd2cc [2021-10-11 02:26:06,335 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a622b0d-f870-4066-9a21-c342cd33e622/bin/utaipan-WLngWcDbfI/data/23575a29a/45cad9977217432f92bf6428fb02306b [2021-10-11 02:26:06,338 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-11 02:26:06,339 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-11 02:26:06,341 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-11 02:26:06,342 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-11 02:26:06,345 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-11 02:26:06,346 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:26:06" (1/1) ... [2021-10-11 02:26:06,348 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3567cf61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:26:06, skipping insertion in model container [2021-10-11 02:26:06,348 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:26:06" (1/1) ... [2021-10-11 02:26:06,355 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-11 02:26:06,370 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-11 02:26:06,536 WARN L226 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_4a622b0d-f870-4066-9a21-c342cd33e622/sv-benchmarks/c/verifythis/elimination_max_rec.c[493,506] [2021-10-11 02:26:06,559 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-11 02:26:06,572 INFO L203 MainTranslator]: Completed pre-run [2021-10-11 02:26:06,584 WARN L226 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_4a622b0d-f870-4066-9a21-c342cd33e622/sv-benchmarks/c/verifythis/elimination_max_rec.c[493,506] [2021-10-11 02:26:06,592 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-11 02:26:06,608 INFO L208 MainTranslator]: Completed translation [2021-10-11 02:26:06,609 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:26:06 WrapperNode [2021-10-11 02:26:06,609 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-11 02:26:06,610 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-11 02:26:06,610 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-11 02:26:06,611 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-11 02:26:06,618 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:26:06" (1/1) ... [2021-10-11 02:26:06,627 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:26:06" (1/1) ... [2021-10-11 02:26:06,650 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-11 02:26:06,651 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-11 02:26:06,651 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-11 02:26:06,651 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-11 02:26:06,661 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:26:06" (1/1) ... [2021-10-11 02:26:06,663 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:26:06" (1/1) ... [2021-10-11 02:26:06,670 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:26:06" (1/1) ... [2021-10-11 02:26:06,671 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:26:06" (1/1) ... [2021-10-11 02:26:06,694 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:26:06" (1/1) ... [2021-10-11 02:26:06,701 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:26:06" (1/1) ... [2021-10-11 02:26:06,703 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:26:06" (1/1) ... [2021-10-11 02:26:06,708 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-11 02:26:06,709 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-11 02:26:06,717 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-11 02:26:06,717 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-11 02:26:06,718 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:26:06" (1/1) ... No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a622b0d-f870-4066-9a21-c342cd33e622/bin/utaipan-WLngWcDbfI/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-11 02:26:06,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-11 02:26:06,798 INFO L130 BoogieDeclarations]: Found specification of procedure check [2021-10-11 02:26:06,798 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2021-10-11 02:26:06,799 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-11 02:26:06,799 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-10-11 02:26:06,799 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-11 02:26:06,799 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-11 02:26:06,799 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-10-11 02:26:06,800 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-10-11 02:26:07,341 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-11 02:26:07,342 INFO L299 CfgBuilder]: Removed 14 assume(true) statements. [2021-10-11 02:26:07,344 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:26:07 BoogieIcfgContainer [2021-10-11 02:26:07,344 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-11 02:26:07,345 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-11 02:26:07,346 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-11 02:26:07,359 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-11 02:26:07,359 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 02:26:06" (1/3) ... [2021-10-11 02:26:07,360 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1be4c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:26:07, skipping insertion in model container [2021-10-11 02:26:07,360 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:26:06" (2/3) ... [2021-10-11 02:26:07,361 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1be4c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:26:07, skipping insertion in model container [2021-10-11 02:26:07,362 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:26:07" (3/3) ... [2021-10-11 02:26:07,363 INFO L111 eAbstractionObserver]: Analyzing ICFG elimination_max_rec.c [2021-10-11 02:26:07,375 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-11 02:26:07,383 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 14 error locations. [2021-10-11 02:26:07,391 INFO L253 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2021-10-11 02:26:07,411 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-10-11 02:26:07,411 INFO L378 AbstractCegarLoop]: Hoare is false [2021-10-11 02:26:07,411 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-10-11 02:26:07,411 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-10-11 02:26:07,411 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-10-11 02:26:07,411 INFO L382 AbstractCegarLoop]: Difference is false [2021-10-11 02:26:07,412 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-10-11 02:26:07,412 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-10-11 02:26:07,430 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2021-10-11 02:26:07,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-10-11 02:26:07,438 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:26:07,438 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-10-11 02:26:07,439 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr0ASSERT_VIOLATIONMEMORY_LEAK, checkErr8REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr9ASSERT_VIOLATIONMEMORY_LEAK, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2021-10-11 02:26:07,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:26:07,445 INFO L82 PathProgramCache]: Analyzing trace with hash -731280393, now seen corresponding path program 1 times [2021-10-11 02:26:07,454 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:26:07,454 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047872137] [2021-10-11 02:26:07,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:26:07,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:26:07,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:26:07,698 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047872137] [2021-10-11 02:26:07,698 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:26:07,699 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-11 02:26:07,699 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512921935] [2021-10-11 02:26:07,703 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-10-11 02:26:07,704 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:26:07,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-11 02:26:07,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-11 02:26:07,720 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 5 states. [2021-10-11 02:26:07,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:26:07,927 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2021-10-11 02:26:07,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-11 02:26:07,929 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2021-10-11 02:26:07,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:26:07,940 INFO L225 Difference]: With dead ends: 66 [2021-10-11 02:26:07,940 INFO L226 Difference]: Without dead ends: 65 [2021-10-11 02:26:07,942 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-10-11 02:26:07,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2021-10-11 02:26:07,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 51. [2021-10-11 02:26:07,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2021-10-11 02:26:07,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 62 transitions. [2021-10-11 02:26:07,980 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 62 transitions. Word has length 6 [2021-10-11 02:26:07,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:26:07,981 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 62 transitions. [2021-10-11 02:26:07,981 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-10-11 02:26:07,981 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 62 transitions. [2021-10-11 02:26:07,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-10-11 02:26:07,982 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:26:07,982 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:26:07,982 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-11 02:26:07,983 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr0ASSERT_VIOLATIONMEMORY_LEAK, checkErr8REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr9ASSERT_VIOLATIONMEMORY_LEAK, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2021-10-11 02:26:07,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:26:07,983 INFO L82 PathProgramCache]: Analyzing trace with hash -1194851665, now seen corresponding path program 1 times [2021-10-11 02:26:07,984 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:26:07,984 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072685469] [2021-10-11 02:26:07,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:26:08,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:26:08,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:26:08,042 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072685469] [2021-10-11 02:26:08,042 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:26:08,042 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 02:26:08,042 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357913128] [2021-10-11 02:26:08,044 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-10-11 02:26:08,044 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:26:08,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-11 02:26:08,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-11 02:26:08,046 INFO L87 Difference]: Start difference. First operand 51 states and 62 transitions. Second operand 5 states. [2021-10-11 02:26:08,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:26:08,108 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2021-10-11 02:26:08,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-11 02:26:08,109 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2021-10-11 02:26:08,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:26:08,110 INFO L225 Difference]: With dead ends: 46 [2021-10-11 02:26:08,110 INFO L226 Difference]: Without dead ends: 46 [2021-10-11 02:26:08,111 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 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-10-11 02:26:08,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2021-10-11 02:26:08,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2021-10-11 02:26:08,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2021-10-11 02:26:08,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2021-10-11 02:26:08,118 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 7 [2021-10-11 02:26:08,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:26:08,118 INFO L481 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2021-10-11 02:26:08,118 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-10-11 02:26:08,118 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2021-10-11 02:26:08,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-10-11 02:26:08,119 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:26:08,119 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:26:08,119 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-11 02:26:08,119 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr0ASSERT_VIOLATIONMEMORY_LEAK, checkErr8REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr9ASSERT_VIOLATIONMEMORY_LEAK, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2021-10-11 02:26:08,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:26:08,120 INFO L82 PathProgramCache]: Analyzing trace with hash -1194851664, now seen corresponding path program 1 times [2021-10-11 02:26:08,121 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:26:08,121 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445499787] [2021-10-11 02:26:08,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:26:08,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:26:08,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:26:08,222 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445499787] [2021-10-11 02:26:08,222 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:26:08,222 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-11 02:26:08,223 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168359681] [2021-10-11 02:26:08,223 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-10-11 02:26:08,223 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:26:08,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-11 02:26:08,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-11 02:26:08,225 INFO L87 Difference]: Start difference. First operand 46 states and 53 transitions. Second operand 6 states. [2021-10-11 02:26:08,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:26:08,420 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2021-10-11 02:26:08,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-11 02:26:08,420 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2021-10-11 02:26:08,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:26:08,426 INFO L225 Difference]: With dead ends: 52 [2021-10-11 02:26:08,426 INFO L226 Difference]: Without dead ends: 52 [2021-10-11 02:26:08,427 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-10-11 02:26:08,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2021-10-11 02:26:08,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 45. [2021-10-11 02:26:08,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2021-10-11 02:26:08,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2021-10-11 02:26:08,436 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 7 [2021-10-11 02:26:08,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:26:08,436 INFO L481 AbstractCegarLoop]: Abstraction has 45 states and 51 transitions. [2021-10-11 02:26:08,437 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-10-11 02:26:08,437 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2021-10-11 02:26:08,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-10-11 02:26:08,437 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:26:08,437 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:26:08,438 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-11 02:26:08,438 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr0ASSERT_VIOLATIONMEMORY_LEAK, checkErr8REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr9ASSERT_VIOLATIONMEMORY_LEAK, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2021-10-11 02:26:08,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:26:08,439 INFO L82 PathProgramCache]: Analyzing trace with hash 1614304061, now seen corresponding path program 1 times [2021-10-11 02:26:08,439 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:26:08,439 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907985638] [2021-10-11 02:26:08,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:26:08,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:26:08,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:26:08,649 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907985638] [2021-10-11 02:26:08,650 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:26:08,650 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-11 02:26:08,650 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524443989] [2021-10-11 02:26:08,651 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-10-11 02:26:08,651 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:26:08,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-11 02:26:08,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-10-11 02:26:08,655 INFO L87 Difference]: Start difference. First operand 45 states and 51 transitions. Second operand 7 states. [2021-10-11 02:26:08,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:26:08,822 INFO L93 Difference]: Finished difference Result 51 states and 53 transitions. [2021-10-11 02:26:08,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-11 02:26:08,822 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2021-10-11 02:26:08,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:26:08,824 INFO L225 Difference]: With dead ends: 51 [2021-10-11 02:26:08,825 INFO L226 Difference]: Without dead ends: 51 [2021-10-11 02:26:08,826 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-10-11 02:26:08,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2021-10-11 02:26:08,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 45. [2021-10-11 02:26:08,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2021-10-11 02:26:08,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2021-10-11 02:26:08,851 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 8 [2021-10-11 02:26:08,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:26:08,852 INFO L481 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2021-10-11 02:26:08,852 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-10-11 02:26:08,852 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2021-10-11 02:26:08,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-10-11 02:26:08,853 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:26:08,854 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:26:08,854 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-11 02:26:08,854 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr0ASSERT_VIOLATIONMEMORY_LEAK, checkErr8REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr9ASSERT_VIOLATIONMEMORY_LEAK, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2021-10-11 02:26:08,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:26:08,855 INFO L82 PathProgramCache]: Analyzing trace with hash -1486703209, now seen corresponding path program 1 times [2021-10-11 02:26:08,855 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:26:08,855 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779768655] [2021-10-11 02:26:08,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:26:08,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:26:08,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:26:08,925 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779768655] [2021-10-11 02:26:08,925 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:26:08,926 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-11 02:26:08,926 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740160018] [2021-10-11 02:26:08,927 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-10-11 02:26:08,928 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:26:08,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 02:26:08,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 02:26:08,929 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand 3 states. [2021-10-11 02:26:08,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:26:08,938 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2021-10-11 02:26:08,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 02:26:08,939 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2021-10-11 02:26:08,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:26:08,941 INFO L225 Difference]: With dead ends: 44 [2021-10-11 02:26:08,942 INFO L226 Difference]: Without dead ends: 44 [2021-10-11 02:26:08,942 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-10-11 02:26:08,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2021-10-11 02:26:08,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2021-10-11 02:26:08,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2021-10-11 02:26:08,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2021-10-11 02:26:08,953 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 9 [2021-10-11 02:26:08,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:26:08,954 INFO L481 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2021-10-11 02:26:08,954 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-10-11 02:26:08,954 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2021-10-11 02:26:08,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-10-11 02:26:08,955 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:26:08,956 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:26:08,956 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-11 02:26:08,956 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr0ASSERT_VIOLATIONMEMORY_LEAK, checkErr8REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr9ASSERT_VIOLATIONMEMORY_LEAK, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2021-10-11 02:26:08,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:26:08,957 INFO L82 PathProgramCache]: Analyzing trace with hash 1502327290, now seen corresponding path program 1 times [2021-10-11 02:26:08,957 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:26:08,958 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707824641] [2021-10-11 02:26:08,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:26:09,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:26:09,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:26:09,066 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707824641] [2021-10-11 02:26:09,066 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:26:09,067 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 02:26:09,067 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464032461] [2021-10-11 02:26:09,067 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-10-11 02:26:09,067 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:26:09,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-11 02:26:09,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-11 02:26:09,069 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand 4 states. [2021-10-11 02:26:09,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:26:09,111 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2021-10-11 02:26:09,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-11 02:26:09,112 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2021-10-11 02:26:09,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:26:09,113 INFO L225 Difference]: With dead ends: 43 [2021-10-11 02:26:09,113 INFO L226 Difference]: Without dead ends: 35 [2021-10-11 02:26:09,113 INFO L677 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-10-11 02:26:09,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2021-10-11 02:26:09,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2021-10-11 02:26:09,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2021-10-11 02:26:09,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2021-10-11 02:26:09,117 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 11 [2021-10-11 02:26:09,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:26:09,117 INFO L481 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2021-10-11 02:26:09,117 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-10-11 02:26:09,117 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2021-10-11 02:26:09,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-10-11 02:26:09,118 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:26:09,118 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:26:09,118 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-11 02:26:09,119 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr0ASSERT_VIOLATIONMEMORY_LEAK, checkErr8REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr9ASSERT_VIOLATIONMEMORY_LEAK, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2021-10-11 02:26:09,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:26:09,119 INFO L82 PathProgramCache]: Analyzing trace with hash 1580973577, now seen corresponding path program 1 times [2021-10-11 02:26:09,120 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:26:09,120 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833657593] [2021-10-11 02:26:09,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:26:09,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:26:09,279 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:26:09,280 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833657593] [2021-10-11 02:26:09,280 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2053527621] [2021-10-11 02:26:09,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a622b0d-f870-4066-9a21-c342cd33e622/bin/utaipan-WLngWcDbfI/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 02:26:09,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:26:09,389 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 24 conjunts are in the unsatisfiable core [2021-10-11 02:26:09,394 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 02:26:09,602 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2021-10-11 02:26:09,603 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:26:09,606 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2021-10-11 02:26:09,606 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:26:09,677 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:26:09,681 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:26:09,684 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:26:09,731 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:26:09,734 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:26:09,737 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:26:09,745 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:26:09,749 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:26:09,751 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:26:09,757 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:26:09,762 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:26:09,764 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:26:09,768 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:26:09,786 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:26:09,787 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-11 02:26:09,814 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2021-10-11 02:26:09,817 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2021-10-11 02:26:09,820 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2021-10-11 02:26:09,827 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2021-10-11 02:26:09,829 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2021-10-11 02:26:09,831 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2021-10-11 02:26:09,842 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2021-10-11 02:26:09,842 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2021-10-11 02:26:09,876 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2021-10-11 02:26:09,876 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2021-10-11 02:26:09,882 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:26:09,882 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1907670247] [2021-10-11 02:26:09,903 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2021-10-11 02:26:09,903 INFO L166 IcfgInterpreter]: Building call graph [2021-10-11 02:26:09,908 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-10-11 02:26:09,909 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-11 02:26:09,910 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 6] total 16 [2021-10-11 02:26:09,910 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688675792] [2021-10-11 02:26:09,910 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-10-11 02:26:09,910 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:26:09,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-10-11 02:26:09,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2021-10-11 02:26:09,911 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 16 states. [2021-10-11 02:26:10,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:26:10,343 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2021-10-11 02:26:10,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-11 02:26:10,344 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 13 [2021-10-11 02:26:10,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:26:10,346 INFO L225 Difference]: With dead ends: 39 [2021-10-11 02:26:10,346 INFO L226 Difference]: Without dead ends: 39 [2021-10-11 02:26:10,347 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=133, Invalid=419, Unknown=0, NotChecked=0, Total=552 [2021-10-11 02:26:10,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2021-10-11 02:26:10,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 33. [2021-10-11 02:26:10,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2021-10-11 02:26:10,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2021-10-11 02:26:10,356 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 13 [2021-10-11 02:26:10,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:26:10,356 INFO L481 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2021-10-11 02:26:10,356 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2021-10-11 02:26:10,356 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2021-10-11 02:26:10,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-10-11 02:26:10,358 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:26:10,358 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2021-10-11 02:26:10,579 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2021-10-11 02:26:10,579 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr0ASSERT_VIOLATIONMEMORY_LEAK, checkErr8REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr9ASSERT_VIOLATIONMEMORY_LEAK, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2021-10-11 02:26:10,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:26:10,580 INFO L82 PathProgramCache]: Analyzing trace with hash 1765544670, now seen corresponding path program 1 times [2021-10-11 02:26:10,580 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:26:10,580 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601650939] [2021-10-11 02:26:10,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:26:10,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:26:10,834 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:26:10,834 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601650939] [2021-10-11 02:26:10,835 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [980672353] [2021-10-11 02:26:10,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a622b0d-f870-4066-9a21-c342cd33e622/bin/utaipan-WLngWcDbfI/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 02:26:10,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:26:10,906 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 32 conjunts are in the unsatisfiable core [2021-10-11 02:26:10,908 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 02:26:11,179 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:26:11,179 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-11 02:26:11,713 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:26:11,714 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1184077083] [2021-10-11 02:26:11,716 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2021-10-11 02:26:11,716 INFO L166 IcfgInterpreter]: Building call graph [2021-10-11 02:26:11,717 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-10-11 02:26:11,717 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-11 02:26:11,717 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 20 [2021-10-11 02:26:11,717 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603516608] [2021-10-11 02:26:11,718 INFO L461 AbstractCegarLoop]: Interpolant automaton has 22 states [2021-10-11 02:26:11,718 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:26:11,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-10-11 02:26:11,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=409, Unknown=0, NotChecked=0, Total=462 [2021-10-11 02:26:11,723 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 22 states. [2021-10-11 02:26:13,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:26:13,759 INFO L93 Difference]: Finished difference Result 80 states and 84 transitions. [2021-10-11 02:26:13,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-10-11 02:26:13,760 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 14 [2021-10-11 02:26:13,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:26:13,761 INFO L225 Difference]: With dead ends: 80 [2021-10-11 02:26:13,761 INFO L226 Difference]: Without dead ends: 80 [2021-10-11 02:26:13,763 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=378, Invalid=1428, Unknown=0, NotChecked=0, Total=1806 [2021-10-11 02:26:13,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2021-10-11 02:26:13,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 60. [2021-10-11 02:26:13,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2021-10-11 02:26:13,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 74 transitions. [2021-10-11 02:26:13,770 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 74 transitions. Word has length 14 [2021-10-11 02:26:13,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:26:13,770 INFO L481 AbstractCegarLoop]: Abstraction has 60 states and 74 transitions. [2021-10-11 02:26:13,770 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2021-10-11 02:26:13,770 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 74 transitions. [2021-10-11 02:26:13,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-10-11 02:26:13,771 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:26:13,771 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:26:13,984 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 02:26:13,985 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr0ASSERT_VIOLATIONMEMORY_LEAK, checkErr8REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr9ASSERT_VIOLATIONMEMORY_LEAK, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2021-10-11 02:26:13,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:26:13,985 INFO L82 PathProgramCache]: Analyzing trace with hash -1102380111, now seen corresponding path program 1 times [2021-10-11 02:26:13,985 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:26:13,985 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202210280] [2021-10-11 02:26:13,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:26:14,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:26:14,124 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:26:14,124 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202210280] [2021-10-11 02:26:14,124 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [795476992] [2021-10-11 02:26:14,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a622b0d-f870-4066-9a21-c342cd33e622/bin/utaipan-WLngWcDbfI/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 02:26:14,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:26:14,189 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 15 conjunts are in the unsatisfiable core [2021-10-11 02:26:14,191 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 02:26:14,389 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:26:14,389 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-11 02:26:14,688 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:26:14,689 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1324112338] [2021-10-11 02:26:14,691 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2021-10-11 02:26:14,691 INFO L166 IcfgInterpreter]: Building call graph [2021-10-11 02:26:14,692 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-10-11 02:26:14,693 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-11 02:26:14,693 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 18 [2021-10-11 02:26:14,693 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4543594] [2021-10-11 02:26:14,693 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-10-11 02:26:14,694 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:26:14,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-10-11 02:26:14,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2021-10-11 02:26:14,695 INFO L87 Difference]: Start difference. First operand 60 states and 74 transitions. Second operand 19 states. [2021-10-11 02:26:15,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:26:15,056 INFO L93 Difference]: Finished difference Result 68 states and 78 transitions. [2021-10-11 02:26:15,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-11 02:26:15,056 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 15 [2021-10-11 02:26:15,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:26:15,057 INFO L225 Difference]: With dead ends: 68 [2021-10-11 02:26:15,058 INFO L226 Difference]: Without dead ends: 68 [2021-10-11 02:26:15,058 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=139, Invalid=563, Unknown=0, NotChecked=0, Total=702 [2021-10-11 02:26:15,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2021-10-11 02:26:15,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 59. [2021-10-11 02:26:15,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2021-10-11 02:26:15,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 70 transitions. [2021-10-11 02:26:15,065 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 70 transitions. Word has length 15 [2021-10-11 02:26:15,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:26:15,065 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 70 transitions. [2021-10-11 02:26:15,065 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2021-10-11 02:26:15,065 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 70 transitions. [2021-10-11 02:26:15,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-10-11 02:26:15,066 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:26:15,066 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2021-10-11 02:26:15,292 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 02:26:15,292 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr0ASSERT_VIOLATIONMEMORY_LEAK, checkErr8REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr9ASSERT_VIOLATIONMEMORY_LEAK, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2021-10-11 02:26:15,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:26:15,293 INFO L82 PathProgramCache]: Analyzing trace with hash -1102690097, now seen corresponding path program 1 times [2021-10-11 02:26:15,293 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:26:15,293 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482785207] [2021-10-11 02:26:15,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:26:15,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:26:15,479 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:26:15,483 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482785207] [2021-10-11 02:26:15,483 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [615246604] [2021-10-11 02:26:15,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a622b0d-f870-4066-9a21-c342cd33e622/bin/utaipan-WLngWcDbfI/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 02:26:15,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:26:15,558 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 32 conjunts are in the unsatisfiable core [2021-10-11 02:26:15,561 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 02:26:15,747 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:26:15,747 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-11 02:26:16,072 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:26:16,073 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [882579076] [2021-10-11 02:26:16,076 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2021-10-11 02:26:16,076 INFO L166 IcfgInterpreter]: Building call graph [2021-10-11 02:26:16,077 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-10-11 02:26:16,077 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-11 02:26:16,077 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2021-10-11 02:26:16,077 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336627752] [2021-10-11 02:26:16,078 INFO L461 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-10-11 02:26:16,078 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:26:16,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-10-11 02:26:16,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=449, Unknown=0, NotChecked=0, Total=506 [2021-10-11 02:26:16,079 INFO L87 Difference]: Start difference. First operand 59 states and 70 transitions. Second operand 23 states. [2021-10-11 02:26:17,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:26:17,227 INFO L93 Difference]: Finished difference Result 70 states and 76 transitions. [2021-10-11 02:26:17,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-11 02:26:17,228 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 15 [2021-10-11 02:26:17,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:26:17,229 INFO L225 Difference]: With dead ends: 70 [2021-10-11 02:26:17,229 INFO L226 Difference]: Without dead ends: 70 [2021-10-11 02:26:17,229 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=241, Invalid=1019, Unknown=0, NotChecked=0, Total=1260 [2021-10-11 02:26:17,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2021-10-11 02:26:17,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 58. [2021-10-11 02:26:17,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2021-10-11 02:26:17,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 67 transitions. [2021-10-11 02:26:17,235 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 67 transitions. Word has length 15 [2021-10-11 02:26:17,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:26:17,235 INFO L481 AbstractCegarLoop]: Abstraction has 58 states and 67 transitions. [2021-10-11 02:26:17,235 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2021-10-11 02:26:17,235 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 67 transitions. [2021-10-11 02:26:17,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-10-11 02:26:17,236 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:26:17,236 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:26:17,448 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 02:26:17,449 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr0ASSERT_VIOLATIONMEMORY_LEAK, checkErr8REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr9ASSERT_VIOLATIONMEMORY_LEAK, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2021-10-11 02:26:17,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:26:17,449 INFO L82 PathProgramCache]: Analyzing trace with hash 185955642, now seen corresponding path program 1 times [2021-10-11 02:26:17,449 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:26:17,449 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663805097] [2021-10-11 02:26:17,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:26:17,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:26:17,634 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:26:17,634 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663805097] [2021-10-11 02:26:17,634 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [350039013] [2021-10-11 02:26:17,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a622b0d-f870-4066-9a21-c342cd33e622/bin/utaipan-WLngWcDbfI/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 02:26:17,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:26:17,699 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 21 conjunts are in the unsatisfiable core [2021-10-11 02:26:17,701 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 02:26:18,172 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:26:18,172 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-11 02:26:19,114 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:26:19,115 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1069383434] [2021-10-11 02:26:19,117 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2021-10-11 02:26:19,117 INFO L166 IcfgInterpreter]: Building call graph [2021-10-11 02:26:19,117 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-10-11 02:26:19,117 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-11 02:26:19,118 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 29 [2021-10-11 02:26:19,118 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036934197] [2021-10-11 02:26:19,118 INFO L461 AbstractCegarLoop]: Interpolant automaton has 30 states [2021-10-11 02:26:19,118 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:26:19,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-10-11 02:26:19,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=764, Unknown=0, NotChecked=0, Total=870 [2021-10-11 02:26:19,119 INFO L87 Difference]: Start difference. First operand 58 states and 67 transitions. Second operand 30 states. [2021-10-11 02:26:20,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:26:20,522 INFO L93 Difference]: Finished difference Result 96 states and 106 transitions. [2021-10-11 02:26:20,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-10-11 02:26:20,523 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 16 [2021-10-11 02:26:20,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:26:20,524 INFO L225 Difference]: With dead ends: 96 [2021-10-11 02:26:20,524 INFO L226 Difference]: Without dead ends: 96 [2021-10-11 02:26:20,526 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 10 SyntacticMatches, 3 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 405 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=346, Invalid=1816, Unknown=0, NotChecked=0, Total=2162 [2021-10-11 02:26:20,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2021-10-11 02:26:20,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 76. [2021-10-11 02:26:20,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2021-10-11 02:26:20,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 86 transitions. [2021-10-11 02:26:20,535 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 86 transitions. Word has length 16 [2021-10-11 02:26:20,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:26:20,535 INFO L481 AbstractCegarLoop]: Abstraction has 76 states and 86 transitions. [2021-10-11 02:26:20,535 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2021-10-11 02:26:20,535 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 86 transitions. [2021-10-11 02:26:20,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-10-11 02:26:20,536 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:26:20,536 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:26:20,752 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2021-10-11 02:26:20,752 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr0ASSERT_VIOLATIONMEMORY_LEAK, checkErr8REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr9ASSERT_VIOLATIONMEMORY_LEAK, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2021-10-11 02:26:20,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:26:20,753 INFO L82 PathProgramCache]: Analyzing trace with hash -1685234995, now seen corresponding path program 1 times [2021-10-11 02:26:20,753 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:26:20,753 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330444062] [2021-10-11 02:26:20,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:26:20,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:26:20,828 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:26:20,829 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330444062] [2021-10-11 02:26:20,829 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [751924074] [2021-10-11 02:26:20,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a622b0d-f870-4066-9a21-c342cd33e622/bin/utaipan-WLngWcDbfI/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 02:26:20,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:26:20,896 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2021-10-11 02:26:20,898 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 02:26:25,038 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:26:25,039 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-11 02:26:56,074 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:26:56,074 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1482499246] [2021-10-11 02:26:56,076 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2021-10-11 02:26:56,077 INFO L166 IcfgInterpreter]: Building call graph [2021-10-11 02:26:56,077 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-10-11 02:26:56,078 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-11 02:26:56,078 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 20 [2021-10-11 02:26:56,079 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121366409] [2021-10-11 02:26:56,079 INFO L461 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-10-11 02:26:56,079 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:26:56,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-10-11 02:26:56,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=290, Unknown=17, NotChecked=0, Total=380 [2021-10-11 02:26:56,081 INFO L87 Difference]: Start difference. First operand 76 states and 86 transitions. Second operand 20 states. [2021-10-11 02:26:56,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:26:56,242 INFO L93 Difference]: Finished difference Result 74 states and 81 transitions. [2021-10-11 02:26:56,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-11 02:26:56,242 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 18 [2021-10-11 02:26:56,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:26:56,244 INFO L225 Difference]: With dead ends: 74 [2021-10-11 02:26:56,244 INFO L226 Difference]: Without dead ends: 68 [2021-10-11 02:26:56,245 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 35.1s TimeCoverageRelationStatistics Valid=121, Invalid=368, Unknown=17, NotChecked=0, Total=506 [2021-10-11 02:26:56,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2021-10-11 02:26:56,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2021-10-11 02:26:56,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2021-10-11 02:26:56,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 74 transitions. [2021-10-11 02:26:56,251 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 74 transitions. Word has length 18 [2021-10-11 02:26:56,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:26:56,252 INFO L481 AbstractCegarLoop]: Abstraction has 68 states and 74 transitions. [2021-10-11 02:26:56,252 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2021-10-11 02:26:56,252 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 74 transitions. [2021-10-11 02:26:56,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-10-11 02:26:56,253 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:26:56,254 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:26:56,460 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 02:26:56,461 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr0ASSERT_VIOLATIONMEMORY_LEAK, checkErr8REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr9ASSERT_VIOLATIONMEMORY_LEAK, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2021-10-11 02:26:56,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:26:56,461 INFO L82 PathProgramCache]: Analyzing trace with hash -875720031, now seen corresponding path program 1 times [2021-10-11 02:26:56,461 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:26:56,461 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461029461] [2021-10-11 02:26:56,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:26:56,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:26:56,939 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-11 02:26:56,940 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461029461] [2021-10-11 02:26:56,940 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [476133441] [2021-10-11 02:26:56,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a622b0d-f870-4066-9a21-c342cd33e622/bin/utaipan-WLngWcDbfI/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 02:26:57,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:26:57,024 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 23 conjunts are in the unsatisfiable core [2021-10-11 02:26:57,027 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 02:26:57,269 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-10-11 02:26:57,269 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-11 02:26:57,481 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-10-11 02:26:57,481 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1526769801] [2021-10-11 02:26:57,483 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2021-10-11 02:26:57,484 INFO L166 IcfgInterpreter]: Building call graph [2021-10-11 02:26:57,484 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-10-11 02:26:57,485 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-11 02:26:57,485 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 6, 6] total 24 [2021-10-11 02:26:57,486 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122284791] [2021-10-11 02:26:57,486 INFO L461 AbstractCegarLoop]: Interpolant automaton has 25 states [2021-10-11 02:26:57,486 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:26:57,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-10-11 02:26:57,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=544, Unknown=0, NotChecked=0, Total=600 [2021-10-11 02:26:57,487 INFO L87 Difference]: Start difference. First operand 68 states and 74 transitions. Second operand 25 states. [2021-10-11 02:26:59,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:26:59,106 INFO L93 Difference]: Finished difference Result 82 states and 85 transitions. [2021-10-11 02:26:59,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-10-11 02:26:59,107 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 30 [2021-10-11 02:26:59,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:26:59,107 INFO L225 Difference]: With dead ends: 82 [2021-10-11 02:26:59,108 INFO L226 Difference]: Without dead ends: 0 [2021-10-11 02:26:59,109 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=274, Invalid=1706, Unknown=0, NotChecked=0, Total=1980 [2021-10-11 02:26:59,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-10-11 02:26:59,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-10-11 02:26:59,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2021-10-11 02:26:59,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-10-11 02:26:59,109 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 30 [2021-10-11 02:26:59,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:26:59,109 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-10-11 02:26:59,110 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2021-10-11 02:26:59,110 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-10-11 02:26:59,110 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-10-11 02:26:59,320 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 02:26:59,324 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 02:26:59 BoogieIcfgContainer [2021-10-11 02:26:59,324 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-11 02:26:59,324 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-11 02:26:59,324 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-11 02:26:59,325 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-11 02:26:59,325 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:26:07" (3/4) ... [2021-10-11 02:26:59,329 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-10-11 02:26:59,337 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure check [2021-10-11 02:26:59,343 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 23 nodes and edges [2021-10-11 02:26:59,344 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2021-10-11 02:26:59,344 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-10-11 02:26:59,344 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-10-11 02:26:59,396 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a622b0d-f870-4066-9a21-c342cd33e622/bin/utaipan-WLngWcDbfI/witness.graphml [2021-10-11 02:26:59,397 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-11 02:26:59,398 INFO L168 Benchmark]: Toolchain (without parser) took 53058.03 ms. Allocated memory was 86.0 MB in the beginning and 281.0 MB in the end (delta: 195.0 MB). Free memory was 50.7 MB in the beginning and 212.8 MB in the end (delta: -162.1 MB). Peak memory consumption was 31.7 MB. Max. memory is 16.1 GB. [2021-10-11 02:26:59,399 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 86.0 MB. Free memory is still 66.9 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-11 02:26:59,399 INFO L168 Benchmark]: CACSL2BoogieTranslator took 268.16 ms. Allocated memory was 86.0 MB in the beginning and 104.9 MB in the end (delta: 18.9 MB). Free memory was 50.6 MB in the beginning and 80.9 MB in the end (delta: -30.4 MB). Peak memory consumption was 5.7 MB. Max. memory is 16.1 GB. [2021-10-11 02:26:59,400 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.82 ms. Allocated memory is still 104.9 MB. Free memory was 80.9 MB in the beginning and 79.2 MB in the end (delta: 1.7 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-11 02:26:59,400 INFO L168 Benchmark]: Boogie Preprocessor took 57.39 ms. Allocated memory is still 104.9 MB. Free memory was 79.2 MB in the beginning and 77.9 MB in the end (delta: 1.3 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-11 02:26:59,401 INFO L168 Benchmark]: RCFGBuilder took 635.19 ms. Allocated memory is still 104.9 MB. Free memory was 77.9 MB in the beginning and 75.5 MB in the end (delta: 2.4 MB). Peak memory consumption was 29.1 MB. Max. memory is 16.1 GB. [2021-10-11 02:26:59,401 INFO L168 Benchmark]: TraceAbstraction took 51978.54 ms. Allocated memory was 104.9 MB in the beginning and 281.0 MB in the end (delta: 176.2 MB). Free memory was 75.3 MB in the beginning and 215.6 MB in the end (delta: -140.3 MB). Peak memory consumption was 36.6 MB. Max. memory is 16.1 GB. [2021-10-11 02:26:59,402 INFO L168 Benchmark]: Witness Printer took 72.48 ms. Allocated memory is still 281.0 MB. Free memory was 215.6 MB in the beginning and 212.8 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-11 02:26:59,405 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.20 ms. Allocated memory is still 86.0 MB. Free memory is still 66.9 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 268.16 ms. Allocated memory was 86.0 MB in the beginning and 104.9 MB in the end (delta: 18.9 MB). Free memory was 50.6 MB in the beginning and 80.9 MB in the end (delta: -30.4 MB). Peak memory consumption was 5.7 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 39.82 ms. Allocated memory is still 104.9 MB. Free memory was 80.9 MB in the beginning and 79.2 MB in the end (delta: 1.7 MB). There was no memory consumed. Max. memory is 16.1 GB. * Boogie Preprocessor took 57.39 ms. Allocated memory is still 104.9 MB. Free memory was 79.2 MB in the beginning and 77.9 MB in the end (delta: 1.3 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 635.19 ms. Allocated memory is still 104.9 MB. Free memory was 77.9 MB in the beginning and 75.5 MB in the end (delta: 2.4 MB). Peak memory consumption was 29.1 MB. Max. memory is 16.1 GB. * TraceAbstraction took 51978.54 ms. Allocated memory was 104.9 MB in the beginning and 281.0 MB in the end (delta: 176.2 MB). Free memory was 75.3 MB in the beginning and 215.6 MB in the end (delta: -140.3 MB). Peak memory consumption was 36.6 MB. Max. memory is 16.1 GB. * Witness Printer took 72.48 ms. Allocated memory is still 281.0 MB. Free memory was 215.6 MB in the beginning and 212.8 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 41]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 48]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 48]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 48]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 25]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 35]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 25]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 25]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 34]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 34]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 25]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 35]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 14 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 38 locations, 14 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 51.9s, OverallIterations: 13, TraceHistogramMax: 3, AutomataDifference: 7.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 222 SDtfs, 1538 SDslu, 770 SDs, 0 SdLazy, 1941 SolverSat, 357 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 425 GetRequests, 158 SyntacticMatches, 9 SemanticMatches, 258 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1264 ImplicationChecksByTransitivity, 43.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=76occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 94 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 41.1s InterpolantComputationTime, 290 NumberOfCodeBlocks, 290 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 384 ConstructedInterpolants, 23 QuantifiedInterpolants, 89080 SizeOfPredicates, 117 NumberOfNonLiveVariables, 1099 ConjunctsInSsa, 175 ConjunctsInUnsatCore, 27 InterpolantComputations, 6 PerfectInterpolantSequences, 29/108 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 correct! Received shutdown request...