./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/sll2c_update_all.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_b6f77874-5c8f-4444-bd58-6d2f99f32a16/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_b6f77874-5c8f-4444-bd58-6d2f99f32a16/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_b6f77874-5c8f-4444-bd58-6d2f99f32a16/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_b6f77874-5c8f-4444-bd58-6d2f99f32a16/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2c_update_all.i -s /tmp/vcloud-vcloud-master/worker/working_dir_b6f77874-5c8f-4444-bd58-6d2f99f32a16/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_b6f77874-5c8f-4444-bd58-6d2f99f32a16/bin/utaipan --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 abd6dbc145d5f477746656086724ee83e0738836 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_b6f77874-5c8f-4444-bd58-6d2f99f32a16/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_b6f77874-5c8f-4444-bd58-6d2f99f32a16/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_b6f77874-5c8f-4444-bd58-6d2f99f32a16/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_b6f77874-5c8f-4444-bd58-6d2f99f32a16/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2c_update_all.i -s /tmp/vcloud-vcloud-master/worker/working_dir_b6f77874-5c8f-4444-bd58-6d2f99f32a16/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_b6f77874-5c8f-4444-bd58-6d2f99f32a16/bin/utaipan --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 abd6dbc145d5f477746656086724ee83e0738836 ...................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: Sort FloatRoundingMode not declared --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 11:26:28,898 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 11:26:28,899 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 11:26:28,909 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 11:26:28,910 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 11:26:28,913 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 11:26:28,914 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 11:26:28,916 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 11:26:28,917 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 11:26:28,918 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 11:26:28,918 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 11:26:28,919 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 11:26:28,919 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 11:26:28,920 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 11:26:28,921 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 11:26:28,921 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 11:26:28,922 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 11:26:28,923 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 11:26:28,924 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 11:26:28,925 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 11:26:28,926 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 11:26:28,927 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 11:26:28,928 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 11:26:28,928 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 11:26:28,930 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 11:26:28,930 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 11:26:28,930 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 11:26:28,931 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 11:26:28,936 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 11:26:28,937 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 11:26:28,938 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 11:26:28,938 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 11:26:28,939 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 11:26:28,939 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 11:26:28,940 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 11:26:28,940 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 11:26:28,940 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 11:26:28,941 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 11:26:28,941 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 11:26:28,941 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 11:26:28,942 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 11:26:28,942 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_b6f77874-5c8f-4444-bd58-6d2f99f32a16/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2019-10-22 11:26:28,957 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 11:26:28,961 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 11:26:28,962 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-22 11:26:28,962 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-22 11:26:28,962 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-22 11:26:28,962 INFO L138 SettingsManager]: * Explicit value domain=true [2019-10-22 11:26:28,963 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-10-22 11:26:28,963 INFO L138 SettingsManager]: * Octagon Domain=false [2019-10-22 11:26:28,963 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-10-22 11:26:28,963 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-10-22 11:26:28,963 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-10-22 11:26:28,963 INFO L138 SettingsManager]: * Interval Domain=false [2019-10-22 11:26:28,964 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 11:26:28,964 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 11:26:28,964 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 11:26:28,964 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 11:26:28,964 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 11:26:28,964 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 11:26:28,965 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 11:26:28,965 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 11:26:28,965 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-10-22 11:26:28,965 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-10-22 11:26:28,965 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-10-22 11:26:28,965 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 11:26:28,965 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 11:26:28,966 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 11:26:28,966 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 11:26:28,966 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 11:26:28,966 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 11:26:28,968 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:26:28,968 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 11:26:28,968 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 11:26:28,968 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-22 11:26:28,968 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 11:26:28,968 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-22 11:26:28,969 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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-vcloud-master/worker/working_dir_b6f77874-5c8f-4444-bd58-6d2f99f32a16/bin/utaipan 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 -> abd6dbc145d5f477746656086724ee83e0738836 [2019-10-22 11:26:29,001 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 11:26:29,011 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 11:26:29,014 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 11:26:29,018 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 11:26:29,018 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 11:26:29,019 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_b6f77874-5c8f-4444-bd58-6d2f99f32a16/bin/utaipan/../../sv-benchmarks/c/list-simple/sll2c_update_all.i [2019-10-22 11:26:29,071 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b6f77874-5c8f-4444-bd58-6d2f99f32a16/bin/utaipan/data/5e381f73e/703e8a8b972b4e9ab67da1d867646ecd/FLAGb29f24ed9 [2019-10-22 11:26:29,481 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 11:26:29,482 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_b6f77874-5c8f-4444-bd58-6d2f99f32a16/sv-benchmarks/c/list-simple/sll2c_update_all.i [2019-10-22 11:26:29,493 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b6f77874-5c8f-4444-bd58-6d2f99f32a16/bin/utaipan/data/5e381f73e/703e8a8b972b4e9ab67da1d867646ecd/FLAGb29f24ed9 [2019-10-22 11:26:29,854 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_b6f77874-5c8f-4444-bd58-6d2f99f32a16/bin/utaipan/data/5e381f73e/703e8a8b972b4e9ab67da1d867646ecd [2019-10-22 11:26:29,857 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 11:26:29,859 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 11:26:29,860 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 11:26:29,860 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 11:26:29,864 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 11:26:29,865 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:26:29" (1/1) ... [2019-10-22 11:26:29,867 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e1c72df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:29, skipping insertion in model container [2019-10-22 11:26:29,868 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:26:29" (1/1) ... [2019-10-22 11:26:29,875 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 11:26:29,921 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 11:26:30,313 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:26:30,327 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 11:26:30,400 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:26:30,449 INFO L192 MainTranslator]: Completed translation [2019-10-22 11:26:30,450 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:30 WrapperNode [2019-10-22 11:26:30,450 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 11:26:30,451 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 11:26:30,451 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 11:26:30,451 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 11:26:30,459 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:30" (1/1) ... [2019-10-22 11:26:30,472 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:30" (1/1) ... [2019-10-22 11:26:30,495 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 11:26:30,495 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 11:26:30,495 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 11:26:30,495 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 11:26:30,502 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:30" (1/1) ... [2019-10-22 11:26:30,502 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:30" (1/1) ... [2019-10-22 11:26:30,507 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:30" (1/1) ... [2019-10-22 11:26:30,507 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:30" (1/1) ... [2019-10-22 11:26:30,516 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:30" (1/1) ... [2019-10-22 11:26:30,521 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:30" (1/1) ... [2019-10-22 11:26:30,523 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:30" (1/1) ... [2019-10-22 11:26:30,534 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 11:26:30,536 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 11:26:30,536 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 11:26:30,537 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 11:26:30,537 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:30" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b6f77874-5c8f-4444-bd58-6d2f99f32a16/bin/utaipan/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 [2019-10-22 11:26:30,586 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 11:26:30,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 11:26:30,586 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-22 11:26:30,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-22 11:26:30,587 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-22 11:26:30,587 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 11:26:30,587 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 11:26:30,587 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 11:26:31,009 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 11:26:31,009 INFO L284 CfgBuilder]: Removed 26 assume(true) statements. [2019-10-22 11:26:31,010 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:26:31 BoogieIcfgContainer [2019-10-22 11:26:31,011 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 11:26:31,011 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 11:26:31,012 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 11:26:31,015 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 11:26:31,015 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 11:26:29" (1/3) ... [2019-10-22 11:26:31,016 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@551f5f63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:26:31, skipping insertion in model container [2019-10-22 11:26:31,017 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:30" (2/3) ... [2019-10-22 11:26:31,017 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@551f5f63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:26:31, skipping insertion in model container [2019-10-22 11:26:31,018 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:26:31" (3/3) ... [2019-10-22 11:26:31,019 INFO L109 eAbstractionObserver]: Analyzing ICFG sll2c_update_all.i [2019-10-22 11:26:31,029 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 11:26:31,037 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 31 error locations. [2019-10-22 11:26:31,048 INFO L249 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2019-10-22 11:26:31,069 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 11:26:31,070 INFO L374 AbstractCegarLoop]: Hoare is false [2019-10-22 11:26:31,070 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 11:26:31,070 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 11:26:31,070 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 11:26:31,070 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 11:26:31,070 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 11:26:31,070 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 11:26:31,090 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states. [2019-10-22 11:26:31,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-10-22 11:26:31,099 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:31,099 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-10-22 11:26:31,101 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-10-22 11:26:31,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:31,108 INFO L82 PathProgramCache]: Analyzing trace with hash 925702, now seen corresponding path program 1 times [2019-10-22 11:26:31,116 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:31,117 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796320079] [2019-10-22 11:26:31,117 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:31,118 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:31,118 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:31,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:31,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:26:31,275 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796320079] [2019-10-22 11:26:31,276 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:31,276 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:26:31,277 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760082830] [2019-10-22 11:26:31,280 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:26:31,282 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:31,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:26:31,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:26:31,299 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 3 states. [2019-10-22 11:26:31,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:31,417 INFO L93 Difference]: Finished difference Result 103 states and 111 transitions. [2019-10-22 11:26:31,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:26:31,419 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-10-22 11:26:31,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:31,427 INFO L225 Difference]: With dead ends: 103 [2019-10-22 11:26:31,427 INFO L226 Difference]: Without dead ends: 96 [2019-10-22 11:26:31,429 INFO L600 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 [2019-10-22 11:26:31,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-10-22 11:26:31,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 76. [2019-10-22 11:26:31,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-10-22 11:26:31,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 82 transitions. [2019-10-22 11:26:31,462 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 82 transitions. Word has length 4 [2019-10-22 11:26:31,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:31,462 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 82 transitions. [2019-10-22 11:26:31,462 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:26:31,463 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2019-10-22 11:26:31,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-10-22 11:26:31,463 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:31,463 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-10-22 11:26:31,463 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-10-22 11:26:31,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:31,464 INFO L82 PathProgramCache]: Analyzing trace with hash 925703, now seen corresponding path program 1 times [2019-10-22 11:26:31,464 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:31,464 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190904831] [2019-10-22 11:26:31,464 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:31,464 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:31,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:31,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:31,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:26:31,510 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190904831] [2019-10-22 11:26:31,510 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:31,510 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:26:31,510 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200356126] [2019-10-22 11:26:31,511 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:26:31,512 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:31,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:26:31,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:26:31,512 INFO L87 Difference]: Start difference. First operand 76 states and 82 transitions. Second operand 3 states. [2019-10-22 11:26:31,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:31,567 INFO L93 Difference]: Finished difference Result 72 states and 78 transitions. [2019-10-22 11:26:31,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:26:31,569 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-10-22 11:26:31,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:31,570 INFO L225 Difference]: With dead ends: 72 [2019-10-22 11:26:31,570 INFO L226 Difference]: Without dead ends: 72 [2019-10-22 11:26:31,571 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:26:31,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-10-22 11:26:31,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-10-22 11:26:31,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-10-22 11:26:31,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 78 transitions. [2019-10-22 11:26:31,577 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 78 transitions. Word has length 4 [2019-10-22 11:26:31,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:31,577 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 78 transitions. [2019-10-22 11:26:31,578 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:26:31,578 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 78 transitions. [2019-10-22 11:26:31,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-10-22 11:26:31,578 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:31,580 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:26:31,580 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-10-22 11:26:31,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:31,580 INFO L82 PathProgramCache]: Analyzing trace with hash 2097994085, now seen corresponding path program 1 times [2019-10-22 11:26:31,580 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:31,581 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206737487] [2019-10-22 11:26:31,581 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:31,581 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:31,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:31,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:31,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:26:31,649 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206737487] [2019-10-22 11:26:31,649 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:31,649 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:26:31,649 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451642829] [2019-10-22 11:26:31,650 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:26:31,650 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:31,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:26:31,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:26:31,651 INFO L87 Difference]: Start difference. First operand 72 states and 78 transitions. Second operand 3 states. [2019-10-22 11:26:31,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:31,673 INFO L93 Difference]: Finished difference Result 82 states and 88 transitions. [2019-10-22 11:26:31,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:26:31,677 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-10-22 11:26:31,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:31,678 INFO L225 Difference]: With dead ends: 82 [2019-10-22 11:26:31,678 INFO L226 Difference]: Without dead ends: 82 [2019-10-22 11:26:31,678 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:26:31,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-10-22 11:26:31,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 73. [2019-10-22 11:26:31,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-10-22 11:26:31,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 79 transitions. [2019-10-22 11:26:31,686 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 79 transitions. Word has length 9 [2019-10-22 11:26:31,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:31,686 INFO L462 AbstractCegarLoop]: Abstraction has 73 states and 79 transitions. [2019-10-22 11:26:31,686 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:26:31,686 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 79 transitions. [2019-10-22 11:26:31,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-22 11:26:31,687 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:31,687 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:26:31,687 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-10-22 11:26:31,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:31,687 INFO L82 PathProgramCache]: Analyzing trace with hash 231455864, now seen corresponding path program 1 times [2019-10-22 11:26:31,688 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:31,688 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069375636] [2019-10-22 11:26:31,688 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:31,688 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:31,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:31,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:31,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:26:31,765 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069375636] [2019-10-22 11:26:31,766 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:31,766 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:26:31,766 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254440639] [2019-10-22 11:26:31,766 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:26:31,767 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:31,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:26:31,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:26:31,767 INFO L87 Difference]: Start difference. First operand 73 states and 79 transitions. Second operand 5 states. [2019-10-22 11:26:31,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:31,909 INFO L93 Difference]: Finished difference Result 97 states and 103 transitions. [2019-10-22 11:26:31,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 11:26:31,909 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-10-22 11:26:31,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:31,910 INFO L225 Difference]: With dead ends: 97 [2019-10-22 11:26:31,910 INFO L226 Difference]: Without dead ends: 97 [2019-10-22 11:26:31,911 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-22 11:26:31,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-10-22 11:26:31,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 72. [2019-10-22 11:26:31,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-10-22 11:26:31,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 78 transitions. [2019-10-22 11:26:31,915 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 78 transitions. Word has length 14 [2019-10-22 11:26:31,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:31,916 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 78 transitions. [2019-10-22 11:26:31,916 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:26:31,916 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 78 transitions. [2019-10-22 11:26:31,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-22 11:26:31,916 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:31,916 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:26:31,917 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-10-22 11:26:31,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:31,917 INFO L82 PathProgramCache]: Analyzing trace with hash 231455865, now seen corresponding path program 1 times [2019-10-22 11:26:31,917 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:31,917 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956942439] [2019-10-22 11:26:31,917 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:31,917 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:31,918 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:31,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:31,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:26:31,980 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956942439] [2019-10-22 11:26:31,981 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:31,981 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:26:31,981 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298347869] [2019-10-22 11:26:31,981 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:26:31,982 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:31,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:26:31,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:26:31,983 INFO L87 Difference]: Start difference. First operand 72 states and 78 transitions. Second operand 5 states. [2019-10-22 11:26:32,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:32,089 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2019-10-22 11:26:32,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 11:26:32,090 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-10-22 11:26:32,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:32,091 INFO L225 Difference]: With dead ends: 76 [2019-10-22 11:26:32,091 INFO L226 Difference]: Without dead ends: 76 [2019-10-22 11:26:32,091 INFO L600 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 [2019-10-22 11:26:32,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-10-22 11:26:32,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 71. [2019-10-22 11:26:32,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-10-22 11:26:32,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 77 transitions. [2019-10-22 11:26:32,095 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 77 transitions. Word has length 14 [2019-10-22 11:26:32,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:32,095 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 77 transitions. [2019-10-22 11:26:32,095 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:26:32,096 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 77 transitions. [2019-10-22 11:26:32,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-22 11:26:32,096 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:32,096 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:26:32,096 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-10-22 11:26:32,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:32,097 INFO L82 PathProgramCache]: Analyzing trace with hash 1879150547, now seen corresponding path program 1 times [2019-10-22 11:26:32,097 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:32,097 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722224698] [2019-10-22 11:26:32,097 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:32,097 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:32,097 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:32,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:32,180 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-22 11:26:32,180 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722224698] [2019-10-22 11:26:32,180 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:32,180 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:26:32,181 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320220460] [2019-10-22 11:26:32,181 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 11:26:32,181 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:32,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 11:26:32,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:26:32,182 INFO L87 Difference]: Start difference. First operand 71 states and 77 transitions. Second operand 6 states. [2019-10-22 11:26:32,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:32,292 INFO L93 Difference]: Finished difference Result 90 states and 96 transitions. [2019-10-22 11:26:32,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 11:26:32,293 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-10-22 11:26:32,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:32,294 INFO L225 Difference]: With dead ends: 90 [2019-10-22 11:26:32,294 INFO L226 Difference]: Without dead ends: 90 [2019-10-22 11:26:32,294 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-22 11:26:32,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-10-22 11:26:32,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 70. [2019-10-22 11:26:32,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-10-22 11:26:32,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 76 transitions. [2019-10-22 11:26:32,299 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 76 transitions. Word has length 17 [2019-10-22 11:26:32,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:32,299 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 76 transitions. [2019-10-22 11:26:32,300 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 11:26:32,300 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2019-10-22 11:26:32,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-22 11:26:32,300 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:32,300 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:26:32,301 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-10-22 11:26:32,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:32,301 INFO L82 PathProgramCache]: Analyzing trace with hash 1879150548, now seen corresponding path program 1 times [2019-10-22 11:26:32,301 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:32,302 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735952867] [2019-10-22 11:26:32,302 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:32,302 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:32,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:32,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:32,399 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:26:32,399 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735952867] [2019-10-22 11:26:32,399 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1927525889] [2019-10-22 11:26:32,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b6f77874-5c8f-4444-bd58-6d2f99f32a16/bin/utaipan/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 [2019-10-22 11:26:32,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:32,465 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-22 11:26:32,470 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:26:32,514 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-22 11:26:32,515 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:26:32,518 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:26:32,518 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:26:32,518 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-10-22 11:26:32,593 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:26:32,593 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 33 [2019-10-22 11:26:32,594 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:26:32,613 INFO L567 ElimStorePlain]: treesize reduction 14, result has 54.8 percent of original size [2019-10-22 11:26:32,614 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 11:26:32,614 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:17 [2019-10-22 11:26:32,631 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-22 11:26:32,632 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:26:32,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:26:32,763 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:26:32,763 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-22 11:26:32,763 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 6] total 15 [2019-10-22 11:26:32,764 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120245127] [2019-10-22 11:26:32,764 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 11:26:32,764 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:32,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 11:26:32,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2019-10-22 11:26:32,765 INFO L87 Difference]: Start difference. First operand 70 states and 76 transitions. Second operand 6 states. [2019-10-22 11:26:32,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:32,903 INFO L93 Difference]: Finished difference Result 69 states and 75 transitions. [2019-10-22 11:26:32,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 11:26:32,903 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-10-22 11:26:32,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:32,904 INFO L225 Difference]: With dead ends: 69 [2019-10-22 11:26:32,904 INFO L226 Difference]: Without dead ends: 69 [2019-10-22 11:26:32,904 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2019-10-22 11:26:32,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-10-22 11:26:32,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-10-22 11:26:32,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-10-22 11:26:32,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 75 transitions. [2019-10-22 11:26:32,907 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 75 transitions. Word has length 17 [2019-10-22 11:26:32,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:32,908 INFO L462 AbstractCegarLoop]: Abstraction has 69 states and 75 transitions. [2019-10-22 11:26:32,908 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 11:26:32,908 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 75 transitions. [2019-10-22 11:26:32,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-22 11:26:32,908 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:32,908 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:26:33,109 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 11:26:33,110 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-10-22 11:26:33,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:33,111 INFO L82 PathProgramCache]: Analyzing trace with hash -687020393, now seen corresponding path program 1 times [2019-10-22 11:26:33,111 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:33,111 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019105582] [2019-10-22 11:26:33,111 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:33,111 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:33,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:33,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:33,221 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:26:33,222 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019105582] [2019-10-22 11:26:33,222 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:33,222 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-22 11:26:33,222 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915828371] [2019-10-22 11:26:33,223 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-22 11:26:33,223 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:33,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-22 11:26:33,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-22 11:26:33,223 INFO L87 Difference]: Start difference. First operand 69 states and 75 transitions. Second operand 9 states. [2019-10-22 11:26:33,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:33,527 INFO L93 Difference]: Finished difference Result 140 states and 151 transitions. [2019-10-22 11:26:33,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-22 11:26:33,527 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2019-10-22 11:26:33,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:33,528 INFO L225 Difference]: With dead ends: 140 [2019-10-22 11:26:33,528 INFO L226 Difference]: Without dead ends: 140 [2019-10-22 11:26:33,529 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2019-10-22 11:26:33,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-10-22 11:26:33,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 72. [2019-10-22 11:26:33,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-10-22 11:26:33,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 81 transitions. [2019-10-22 11:26:33,532 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 81 transitions. Word has length 22 [2019-10-22 11:26:33,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:33,533 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 81 transitions. [2019-10-22 11:26:33,533 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-22 11:26:33,533 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 81 transitions. [2019-10-22 11:26:33,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-22 11:26:33,533 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:33,533 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:26:33,534 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-10-22 11:26:33,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:33,534 INFO L82 PathProgramCache]: Analyzing trace with hash -687020392, now seen corresponding path program 1 times [2019-10-22 11:26:33,535 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:33,535 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323643804] [2019-10-22 11:26:33,535 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:33,535 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:33,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:33,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:33,668 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:26:33,669 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323643804] [2019-10-22 11:26:33,669 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:33,669 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-22 11:26:33,669 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352507829] [2019-10-22 11:26:33,669 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-22 11:26:33,670 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:33,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-22 11:26:33,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-22 11:26:33,670 INFO L87 Difference]: Start difference. First operand 72 states and 81 transitions. Second operand 9 states. [2019-10-22 11:26:33,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:33,991 INFO L93 Difference]: Finished difference Result 120 states and 131 transitions. [2019-10-22 11:26:33,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-22 11:26:33,991 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2019-10-22 11:26:33,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:33,992 INFO L225 Difference]: With dead ends: 120 [2019-10-22 11:26:33,992 INFO L226 Difference]: Without dead ends: 120 [2019-10-22 11:26:33,993 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2019-10-22 11:26:33,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-10-22 11:26:33,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 72. [2019-10-22 11:26:33,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-10-22 11:26:33,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 79 transitions. [2019-10-22 11:26:33,996 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 79 transitions. Word has length 22 [2019-10-22 11:26:33,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:33,996 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 79 transitions. [2019-10-22 11:26:33,997 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-22 11:26:33,997 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 79 transitions. [2019-10-22 11:26:33,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-22 11:26:33,997 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:33,997 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:26:33,998 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-10-22 11:26:33,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:33,998 INFO L82 PathProgramCache]: Analyzing trace with hash 1197103645, now seen corresponding path program 1 times [2019-10-22 11:26:33,998 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:33,998 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430850869] [2019-10-22 11:26:33,998 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:33,998 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:33,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:34,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:34,058 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:26:34,058 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430850869] [2019-10-22 11:26:34,058 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:34,059 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-22 11:26:34,059 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633484400] [2019-10-22 11:26:34,059 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-22 11:26:34,059 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:34,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-22 11:26:34,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-22 11:26:34,060 INFO L87 Difference]: Start difference. First operand 72 states and 79 transitions. Second operand 9 states. [2019-10-22 11:26:34,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:34,332 INFO L93 Difference]: Finished difference Result 129 states and 139 transitions. [2019-10-22 11:26:34,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-22 11:26:34,332 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2019-10-22 11:26:34,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:34,333 INFO L225 Difference]: With dead ends: 129 [2019-10-22 11:26:34,333 INFO L226 Difference]: Without dead ends: 129 [2019-10-22 11:26:34,334 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2019-10-22 11:26:34,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-10-22 11:26:34,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 75. [2019-10-22 11:26:34,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-10-22 11:26:34,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 85 transitions. [2019-10-22 11:26:34,339 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 85 transitions. Word has length 24 [2019-10-22 11:26:34,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:34,339 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 85 transitions. [2019-10-22 11:26:34,339 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-22 11:26:34,339 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 85 transitions. [2019-10-22 11:26:34,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-22 11:26:34,340 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:34,340 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:26:34,340 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-10-22 11:26:34,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:34,341 INFO L82 PathProgramCache]: Analyzing trace with hash 1197103646, now seen corresponding path program 1 times [2019-10-22 11:26:34,341 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:34,341 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285980642] [2019-10-22 11:26:34,341 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:34,341 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:34,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:34,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:34,469 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:26:34,470 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285980642] [2019-10-22 11:26:34,470 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:34,470 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-22 11:26:34,470 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587431700] [2019-10-22 11:26:34,470 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-22 11:26:34,471 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:34,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-22 11:26:34,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-22 11:26:34,471 INFO L87 Difference]: Start difference. First operand 75 states and 85 transitions. Second operand 9 states. [2019-10-22 11:26:34,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:34,748 INFO L93 Difference]: Finished difference Result 112 states and 122 transitions. [2019-10-22 11:26:34,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-22 11:26:34,749 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2019-10-22 11:26:34,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:34,750 INFO L225 Difference]: With dead ends: 112 [2019-10-22 11:26:34,750 INFO L226 Difference]: Without dead ends: 112 [2019-10-22 11:26:34,750 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2019-10-22 11:26:34,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-10-22 11:26:34,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 75. [2019-10-22 11:26:34,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-10-22 11:26:34,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 83 transitions. [2019-10-22 11:26:34,762 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 83 transitions. Word has length 24 [2019-10-22 11:26:34,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:34,762 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 83 transitions. [2019-10-22 11:26:34,763 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-22 11:26:34,763 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 83 transitions. [2019-10-22 11:26:34,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-22 11:26:34,763 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:34,763 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:26:34,764 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-10-22 11:26:34,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:34,764 INFO L82 PathProgramCache]: Analyzing trace with hash -1503677429, now seen corresponding path program 1 times [2019-10-22 11:26:34,764 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:34,764 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739939445] [2019-10-22 11:26:34,764 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:34,764 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:34,764 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:34,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:34,804 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-22 11:26:34,804 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739939445] [2019-10-22 11:26:34,804 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:34,804 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:26:34,804 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207853849] [2019-10-22 11:26:34,805 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:26:34,805 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:34,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:26:34,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:26:34,805 INFO L87 Difference]: Start difference. First operand 75 states and 83 transitions. Second operand 4 states. [2019-10-22 11:26:34,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:34,839 INFO L93 Difference]: Finished difference Result 208 states and 230 transitions. [2019-10-22 11:26:34,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:26:34,839 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-10-22 11:26:34,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:34,840 INFO L225 Difference]: With dead ends: 208 [2019-10-22 11:26:34,840 INFO L226 Difference]: Without dead ends: 208 [2019-10-22 11:26:34,841 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:26:34,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2019-10-22 11:26:34,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 77. [2019-10-22 11:26:34,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-10-22 11:26:34,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 86 transitions. [2019-10-22 11:26:34,843 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 86 transitions. Word has length 25 [2019-10-22 11:26:34,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:34,844 INFO L462 AbstractCegarLoop]: Abstraction has 77 states and 86 transitions. [2019-10-22 11:26:34,844 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:26:34,844 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 86 transitions. [2019-10-22 11:26:34,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-22 11:26:34,844 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:34,845 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:26:34,845 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-10-22 11:26:34,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:34,845 INFO L82 PathProgramCache]: Analyzing trace with hash -1544526571, now seen corresponding path program 1 times [2019-10-22 11:26:34,845 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:34,845 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885265741] [2019-10-22 11:26:34,846 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:34,846 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:34,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:34,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:34,902 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:26:34,902 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885265741] [2019-10-22 11:26:34,903 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:34,903 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-22 11:26:34,903 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478160067] [2019-10-22 11:26:34,903 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-22 11:26:34,903 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:34,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-22 11:26:34,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-22 11:26:34,904 INFO L87 Difference]: Start difference. First operand 77 states and 86 transitions. Second operand 9 states. [2019-10-22 11:26:35,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:35,181 INFO L93 Difference]: Finished difference Result 100 states and 109 transitions. [2019-10-22 11:26:35,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-22 11:26:35,181 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-10-22 11:26:35,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:35,182 INFO L225 Difference]: With dead ends: 100 [2019-10-22 11:26:35,182 INFO L226 Difference]: Without dead ends: 100 [2019-10-22 11:26:35,182 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2019-10-22 11:26:35,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-10-22 11:26:35,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 80. [2019-10-22 11:26:35,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-10-22 11:26:35,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 92 transitions. [2019-10-22 11:26:35,184 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 92 transitions. Word has length 25 [2019-10-22 11:26:35,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:35,185 INFO L462 AbstractCegarLoop]: Abstraction has 80 states and 92 transitions. [2019-10-22 11:26:35,185 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-22 11:26:35,185 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 92 transitions. [2019-10-22 11:26:35,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-22 11:26:35,185 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:35,185 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:26:35,186 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-10-22 11:26:35,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:35,186 INFO L82 PathProgramCache]: Analyzing trace with hash -1544526570, now seen corresponding path program 1 times [2019-10-22 11:26:35,186 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:35,186 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656222090] [2019-10-22 11:26:35,186 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:35,186 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:35,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:35,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:35,279 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:26:35,280 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656222090] [2019-10-22 11:26:35,280 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:35,280 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-22 11:26:35,280 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294879229] [2019-10-22 11:26:35,280 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-22 11:26:35,280 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:35,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-22 11:26:35,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-22 11:26:35,281 INFO L87 Difference]: Start difference. First operand 80 states and 92 transitions. Second operand 9 states. [2019-10-22 11:26:35,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:35,560 INFO L93 Difference]: Finished difference Result 83 states and 94 transitions. [2019-10-22 11:26:35,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-22 11:26:35,560 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-10-22 11:26:35,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:35,561 INFO L225 Difference]: With dead ends: 83 [2019-10-22 11:26:35,561 INFO L226 Difference]: Without dead ends: 83 [2019-10-22 11:26:35,561 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2019-10-22 11:26:35,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-10-22 11:26:35,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 78. [2019-10-22 11:26:35,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-10-22 11:26:35,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 89 transitions. [2019-10-22 11:26:35,566 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 89 transitions. Word has length 25 [2019-10-22 11:26:35,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:35,566 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 89 transitions. [2019-10-22 11:26:35,567 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-22 11:26:35,567 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 89 transitions. [2019-10-22 11:26:35,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-22 11:26:35,567 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:35,567 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:26:35,568 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-10-22 11:26:35,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:35,568 INFO L82 PathProgramCache]: Analyzing trace with hash -635649543, now seen corresponding path program 1 times [2019-10-22 11:26:35,568 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:35,568 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297837105] [2019-10-22 11:26:35,568 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:35,568 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:35,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:35,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:35,648 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:26:35,648 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297837105] [2019-10-22 11:26:35,648 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:35,648 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-22 11:26:35,648 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401431942] [2019-10-22 11:26:35,649 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-22 11:26:35,649 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:35,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-22 11:26:35,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-22 11:26:35,649 INFO L87 Difference]: Start difference. First operand 78 states and 89 transitions. Second operand 10 states. [2019-10-22 11:26:35,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:35,849 INFO L93 Difference]: Finished difference Result 83 states and 93 transitions. [2019-10-22 11:26:35,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-22 11:26:35,849 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2019-10-22 11:26:35,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:35,850 INFO L225 Difference]: With dead ends: 83 [2019-10-22 11:26:35,850 INFO L226 Difference]: Without dead ends: 83 [2019-10-22 11:26:35,850 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=110, Invalid=232, Unknown=0, NotChecked=0, Total=342 [2019-10-22 11:26:35,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-10-22 11:26:35,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 78. [2019-10-22 11:26:35,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-10-22 11:26:35,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 88 transitions. [2019-10-22 11:26:35,852 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 88 transitions. Word has length 26 [2019-10-22 11:26:35,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:35,852 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 88 transitions. [2019-10-22 11:26:35,852 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-22 11:26:35,852 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 88 transitions. [2019-10-22 11:26:35,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-22 11:26:35,853 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:35,853 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:26:35,853 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-10-22 11:26:35,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:35,854 INFO L82 PathProgramCache]: Analyzing trace with hash 1802948263, now seen corresponding path program 1 times [2019-10-22 11:26:35,854 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:35,854 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359339955] [2019-10-22 11:26:35,854 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:35,854 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:35,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:35,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:35,894 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-22 11:26:35,894 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359339955] [2019-10-22 11:26:35,894 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:35,894 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:26:35,894 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859891912] [2019-10-22 11:26:35,895 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:26:35,895 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:35,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:26:35,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:26:35,895 INFO L87 Difference]: Start difference. First operand 78 states and 88 transitions. Second operand 4 states. [2019-10-22 11:26:35,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:35,921 INFO L93 Difference]: Finished difference Result 143 states and 159 transitions. [2019-10-22 11:26:35,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:26:35,922 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2019-10-22 11:26:35,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:35,923 INFO L225 Difference]: With dead ends: 143 [2019-10-22 11:26:35,923 INFO L226 Difference]: Without dead ends: 143 [2019-10-22 11:26:35,923 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:26:35,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-10-22 11:26:35,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 80. [2019-10-22 11:26:35,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-10-22 11:26:35,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 91 transitions. [2019-10-22 11:26:35,926 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 91 transitions. Word has length 27 [2019-10-22 11:26:35,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:35,926 INFO L462 AbstractCegarLoop]: Abstraction has 80 states and 91 transitions. [2019-10-22 11:26:35,926 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:26:35,926 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 91 transitions. [2019-10-22 11:26:35,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-22 11:26:35,927 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:35,927 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:26:35,927 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-10-22 11:26:35,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:35,927 INFO L82 PathProgramCache]: Analyzing trace with hash -1006327080, now seen corresponding path program 1 times [2019-10-22 11:26:35,927 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:35,928 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566428495] [2019-10-22 11:26:35,928 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:35,928 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:35,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:35,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:35,973 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:26:35,973 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566428495] [2019-10-22 11:26:35,973 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [49951948] [2019-10-22 11:26:35,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b6f77874-5c8f-4444-bd58-6d2f99f32a16/bin/utaipan/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 [2019-10-22 11:26:36,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:36,036 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-22 11:26:36,038 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:26:36,048 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-22 11:26:36,048 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:26:36,064 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-22 11:26:36,064 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-22 11:26:36,065 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [5] total 8 [2019-10-22 11:26:36,065 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110868119] [2019-10-22 11:26:36,065 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 11:26:36,065 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:36,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 11:26:36,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-10-22 11:26:36,066 INFO L87 Difference]: Start difference. First operand 80 states and 91 transitions. Second operand 6 states. [2019-10-22 11:26:36,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:36,105 INFO L93 Difference]: Finished difference Result 89 states and 98 transitions. [2019-10-22 11:26:36,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:26:36,106 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-10-22 11:26:36,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:36,106 INFO L225 Difference]: With dead ends: 89 [2019-10-22 11:26:36,106 INFO L226 Difference]: Without dead ends: 89 [2019-10-22 11:26:36,107 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-10-22 11:26:36,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-10-22 11:26:36,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-10-22 11:26:36,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-10-22 11:26:36,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 98 transitions. [2019-10-22 11:26:36,109 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 98 transitions. Word has length 28 [2019-10-22 11:26:36,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:36,109 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 98 transitions. [2019-10-22 11:26:36,109 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 11:26:36,109 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 98 transitions. [2019-10-22 11:26:36,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-22 11:26:36,110 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:36,110 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:26:36,312 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 11:26:36,313 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-10-22 11:26:36,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:36,313 INFO L82 PathProgramCache]: Analyzing trace with hash -966118025, now seen corresponding path program 1 times [2019-10-22 11:26:36,313 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:36,313 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430581853] [2019-10-22 11:26:36,313 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:36,313 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:36,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:36,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:36,621 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:26:36,621 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430581853] [2019-10-22 11:26:36,622 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [116960872] [2019-10-22 11:26:36,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b6f77874-5c8f-4444-bd58-6d2f99f32a16/bin/utaipan/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 [2019-10-22 11:26:36,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:36,671 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 52 conjunts are in the unsatisfiable core [2019-10-22 11:26:36,673 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:26:36,684 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:26:36,685 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-10-22 11:26:36,685 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:26:36,691 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:26:36,691 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:26:36,691 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2019-10-22 11:26:36,753 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-22 11:26:36,753 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:26:36,757 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:26:36,758 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:26:36,758 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2019-10-22 11:26:36,828 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:26:36,829 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 51 [2019-10-22 11:26:36,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:26:36,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:26:36,831 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-10-22 11:26:36,849 INFO L567 ElimStorePlain]: treesize reduction 34, result has 46.0 percent of original size [2019-10-22 11:26:36,850 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 11:26:36,850 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:29 [2019-10-22 11:26:37,012 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:26:37,037 INFO L341 Elim1Store]: treesize reduction 24, result has 55.6 percent of original size [2019-10-22 11:26:37,037 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 52 [2019-10-22 11:26:37,038 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:26:37,059 INFO L567 ElimStorePlain]: treesize reduction 34, result has 48.5 percent of original size [2019-10-22 11:26:37,060 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 11:26:37,060 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:51, output treesize:29 [2019-10-22 11:26:37,121 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:26:37,121 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 31 [2019-10-22 11:26:37,122 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:26:37,130 INFO L567 ElimStorePlain]: treesize reduction 12, result has 45.5 percent of original size [2019-10-22 11:26:37,130 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:26:37,130 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:36, output treesize:5 [2019-10-22 11:26:37,133 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-22 11:26:37,133 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:26:37,139 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 11:26:37,141 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:26:37,142 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 11:26:37,142 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:19 [2019-10-22 11:26:37,269 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:26:37,269 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 28 [2019-10-22 11:26:37,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:26:37,270 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:26:37,273 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:26:37,274 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 11:26:37,274 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:15 [2019-10-22 11:26:37,358 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:26:37,368 INFO L567 ElimStorePlain]: treesize reduction 9, result has 55.0 percent of original size [2019-10-22 11:26:37,368 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:26:37,368 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:31, output treesize:3 [2019-10-22 11:26:37,426 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-22 11:26:37,426 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [1074098584] [2019-10-22 11:26:37,430 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 30 [2019-10-22 11:26:37,469 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-10-22 11:26:37,469 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-22 11:26:37,753 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 11:26:37,754 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: inappropriate decl info IMPLEMENTATION at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Boogie2SmtSymbolTable.getBoogieVar(Boogie2SmtSymbolTable.java:222) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.getBoogieVar(NonrelationalStatementProcessor.java:348) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.handleHavocStatement(NonrelationalStatementProcessor.java:325) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.processStatement(NonrelationalStatementProcessor.java:159) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.process(NonrelationalStatementProcessor.java:138) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.process(NonrelationalStatementProcessor.java:107) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.handleInternalTransition(NonrelationalPostOperator.java:422) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.handleInternalTransition(NonrelationalPostOperator.java:413) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.apply(NonrelationalPostOperator.java:140) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.apply(NonrelationalPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.applyInternally(CompoundDomainPostOperator.java:306) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.apply(CompoundDomainPostOperator.java:131) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.apply(CompoundDomainPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormanCachedPostOperation.restoreOriginalStateVariables(PoormanCachedPostOperation.java:322) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.applyPost(PoormansAbstractPostOperator.java:217) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.apply(PoormansAbstractPostOperator.java:120) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.apply(PoormansAbstractPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.absint.DisjunctiveAbstractState.lambda$17(DisjunctiveAbstractState.java:323) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.absint.DisjunctiveAbstractState.mapCollection(DisjunctiveAbstractState.java:519) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.absint.DisjunctiveAbstractState.apply(DisjunctiveAbstractState.java:323) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.FixpointEngine.calculateAbstractPost(FixpointEngine.java:249) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.FixpointEngine.calculateFixpoint(FixpointEngine.java:134) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.FixpointEngine.run(FixpointEngine.java:105) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.tool.AbstractInterpreter.runWithoutTimeoutAndResults(AbstractInterpreter.java:149) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarAbsIntRunner.generateFixpoints(CegarAbsIntRunner.java:227) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarAbsIntRunner.(CegarAbsIntRunner.java:158) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleAbstractInterpretation.getOrConstructRunner(IpTcStrategyModuleAbstractInterpretation.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleAbstractInterpretation.construct(IpTcStrategyModuleAbstractInterpretation.java:81) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:299) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.generateProof(TraceAbstractionRefinementEngine.java:184) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) 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:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-10-22 11:26:37,758 INFO L168 Benchmark]: Toolchain (without parser) took 7899.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 190.8 MB). Free memory was 939.1 MB in the beginning and 1.0 GB in the end (delta: -72.3 MB). Peak memory consumption was 118.5 MB. Max. memory is 11.5 GB. [2019-10-22 11:26:37,758 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 962.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:26:37,758 INFO L168 Benchmark]: CACSL2BoogieTranslator took 590.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 939.1 MB in the beginning and 1.1 GB in the end (delta: -182.1 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2019-10-22 11:26:37,759 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.24 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-10-22 11:26:37,759 INFO L168 Benchmark]: Boogie Preprocessor took 41.11 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:26:37,759 INFO L168 Benchmark]: RCFGBuilder took 474.46 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 39.9 MB). Peak memory consumption was 39.9 MB. Max. memory is 11.5 GB. [2019-10-22 11:26:37,760 INFO L168 Benchmark]: TraceAbstraction took 6745.30 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 53.5 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 64.6 MB). Peak memory consumption was 118.0 MB. Max. memory is 11.5 GB. [2019-10-22 11:26:37,761 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 962.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 590.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 939.1 MB in the beginning and 1.1 GB in the end (delta: -182.1 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 44.24 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 41.11 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 474.46 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 39.9 MB). Peak memory consumption was 39.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 6745.30 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 53.5 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 64.6 MB). Peak memory consumption was 118.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: inappropriate decl info IMPLEMENTATION de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: inappropriate decl info IMPLEMENTATION: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Boogie2SmtSymbolTable.getBoogieVar(Boogie2SmtSymbolTable.java:222) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-cad4683 [2019-10-22 11:26:39,854 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 11:26:39,855 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 11:26:39,873 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 11:26:39,873 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 11:26:39,874 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 11:26:39,875 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 11:26:39,877 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 11:26:39,880 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 11:26:39,881 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 11:26:39,882 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 11:26:39,883 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 11:26:39,883 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 11:26:39,884 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 11:26:39,885 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 11:26:39,886 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 11:26:39,903 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 11:26:39,904 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 11:26:39,905 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 11:26:39,907 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 11:26:39,909 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 11:26:39,910 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 11:26:39,911 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 11:26:39,911 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 11:26:39,915 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 11:26:39,915 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 11:26:39,915 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 11:26:39,916 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 11:26:39,916 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 11:26:39,917 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 11:26:39,917 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 11:26:39,918 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 11:26:39,919 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 11:26:39,921 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 11:26:39,922 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 11:26:39,922 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 11:26:39,923 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 11:26:39,923 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 11:26:39,923 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 11:26:39,924 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 11:26:39,925 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 11:26:39,926 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_b6f77874-5c8f-4444-bd58-6d2f99f32a16/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2019-10-22 11:26:39,949 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 11:26:39,949 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 11:26:39,950 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-22 11:26:39,955 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-22 11:26:39,955 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-22 11:26:39,955 INFO L138 SettingsManager]: * Explicit value domain=true [2019-10-22 11:26:39,955 INFO L138 SettingsManager]: * Octagon Domain=false [2019-10-22 11:26:39,956 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-10-22 11:26:39,956 INFO L138 SettingsManager]: * Interval Domain=false [2019-10-22 11:26:39,956 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 11:26:39,957 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 11:26:39,957 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 11:26:39,957 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 11:26:39,957 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 11:26:39,957 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 11:26:39,958 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 11:26:39,958 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 11:26:39,958 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-10-22 11:26:39,959 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-10-22 11:26:39,959 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-10-22 11:26:39,959 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 11:26:39,959 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-10-22 11:26:39,959 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-10-22 11:26:39,960 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 11:26:39,960 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 11:26:39,960 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 11:26:39,960 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 11:26:39,960 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 11:26:39,960 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 11:26:39,961 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:26:39,961 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 11:26:39,961 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 11:26:39,961 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2019-10-22 11:26:39,961 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-10-22 11:26:39,962 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-22 11:26:39,962 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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-vcloud-master/worker/working_dir_b6f77874-5c8f-4444-bd58-6d2f99f32a16/bin/utaipan 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 -> abd6dbc145d5f477746656086724ee83e0738836 [2019-10-22 11:26:40,008 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 11:26:40,020 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 11:26:40,024 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 11:26:40,025 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 11:26:40,025 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 11:26:40,026 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_b6f77874-5c8f-4444-bd58-6d2f99f32a16/bin/utaipan/../../sv-benchmarks/c/list-simple/sll2c_update_all.i [2019-10-22 11:26:40,077 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b6f77874-5c8f-4444-bd58-6d2f99f32a16/bin/utaipan/data/a59c06544/fd371bf758084fc1948cce021d32987f/FLAGb91725e4c [2019-10-22 11:26:40,560 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 11:26:40,562 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_b6f77874-5c8f-4444-bd58-6d2f99f32a16/sv-benchmarks/c/list-simple/sll2c_update_all.i [2019-10-22 11:26:40,575 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b6f77874-5c8f-4444-bd58-6d2f99f32a16/bin/utaipan/data/a59c06544/fd371bf758084fc1948cce021d32987f/FLAGb91725e4c [2019-10-22 11:26:40,866 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_b6f77874-5c8f-4444-bd58-6d2f99f32a16/bin/utaipan/data/a59c06544/fd371bf758084fc1948cce021d32987f [2019-10-22 11:26:40,868 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 11:26:40,869 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 11:26:40,870 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 11:26:40,870 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 11:26:40,877 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 11:26:40,878 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:26:40" (1/1) ... [2019-10-22 11:26:40,881 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62f1c206 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:40, skipping insertion in model container [2019-10-22 11:26:40,882 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:26:40" (1/1) ... [2019-10-22 11:26:40,890 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 11:26:40,933 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 11:26:41,316 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:26:41,445 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 11:26:41,499 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:26:41,549 INFO L192 MainTranslator]: Completed translation [2019-10-22 11:26:41,550 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:41 WrapperNode [2019-10-22 11:26:41,550 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 11:26:41,551 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 11:26:41,551 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 11:26:41,551 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 11:26:41,559 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:41" (1/1) ... [2019-10-22 11:26:41,579 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:41" (1/1) ... [2019-10-22 11:26:41,608 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 11:26:41,608 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 11:26:41,609 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 11:26:41,609 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 11:26:41,619 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:41" (1/1) ... [2019-10-22 11:26:41,619 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:41" (1/1) ... [2019-10-22 11:26:41,623 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:41" (1/1) ... [2019-10-22 11:26:41,624 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:41" (1/1) ... [2019-10-22 11:26:41,634 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:41" (1/1) ... [2019-10-22 11:26:41,640 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:41" (1/1) ... [2019-10-22 11:26:41,642 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:41" (1/1) ... [2019-10-22 11:26:41,646 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 11:26:41,646 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 11:26:41,647 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 11:26:41,647 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 11:26:41,648 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:41" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b6f77874-5c8f-4444-bd58-6d2f99f32a16/bin/utaipan/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 [2019-10-22 11:26:41,708 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-10-22 11:26:41,708 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-22 11:26:41,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-22 11:26:41,709 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-22 11:26:41,709 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 11:26:41,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-10-22 11:26:41,709 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 11:26:41,709 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 11:26:42,330 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 11:26:42,331 INFO L284 CfgBuilder]: Removed 26 assume(true) statements. [2019-10-22 11:26:42,332 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:26:42 BoogieIcfgContainer [2019-10-22 11:26:42,332 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 11:26:42,333 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 11:26:42,333 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 11:26:42,336 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 11:26:42,337 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 11:26:40" (1/3) ... [2019-10-22 11:26:42,337 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12ada74f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:26:42, skipping insertion in model container [2019-10-22 11:26:42,337 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:41" (2/3) ... [2019-10-22 11:26:42,338 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12ada74f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:26:42, skipping insertion in model container [2019-10-22 11:26:42,338 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:26:42" (3/3) ... [2019-10-22 11:26:42,340 INFO L109 eAbstractionObserver]: Analyzing ICFG sll2c_update_all.i [2019-10-22 11:26:42,349 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 11:26:42,357 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 31 error locations. [2019-10-22 11:26:42,366 INFO L249 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2019-10-22 11:26:42,388 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 11:26:42,388 INFO L374 AbstractCegarLoop]: Hoare is false [2019-10-22 11:26:42,388 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 11:26:42,388 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 11:26:42,389 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 11:26:42,389 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 11:26:42,389 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 11:26:42,389 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 11:26:42,409 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states. [2019-10-22 11:26:42,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-10-22 11:26:42,420 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:42,421 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-10-22 11:26:42,423 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE]=== [2019-10-22 11:26:42,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:42,427 INFO L82 PathProgramCache]: Analyzing trace with hash 925702, now seen corresponding path program 1 times [2019-10-22 11:26:42,434 INFO L157 tionRefinementEngine]: Executing refinement strategy WALRUS [2019-10-22 11:26:42,434 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [452292534] [2019-10-22 11:26:42,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b6f77874-5c8f-4444-bd58-6d2f99f32a16/bin/utaipan/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:26:42,678 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:26:42,678 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Sort FloatRoundingMode not declared at de.uni_freiburg.informatik.ultimate.logic.NoopScript.sort(NoopScript.java:412) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.sort(WrapperScript.java:223) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.NonDeclaringTermTransferrer.transferSort(NonDeclaringTermTransferrer.java:111) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.DeclarableFunctionSymbol.defineOrDeclare(DeclarableFunctionSymbol.java:160) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.transferHistoryFromRecord(HistoryRecordingScript.java:143) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.transferHistoryFromRecord(HistoryRecordingScript.java:168) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.SmtFunctionsAndAxioms.transferSymbols(SmtFunctionsAndAxioms.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleTraceCheck.createExternalManagedScript(IpTcStrategyModuleTraceCheck.java:81) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCvc4.constructManagedScript(IpTcStrategyModuleCvc4.java:95) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.checkFeasibility(TraceAbstractionRefinementEngine.java:244) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) 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:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-10-22 11:26:42,683 INFO L168 Benchmark]: Toolchain (without parser) took 1813.22 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 947.0 MB in the beginning and 1.0 GB in the end (delta: -96.1 MB). Peak memory consumption was 32.8 MB. Max. memory is 11.5 GB. [2019-10-22 11:26:42,683 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 977.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:26:42,684 INFO L168 Benchmark]: CACSL2BoogieTranslator took 680.93 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -156.1 MB). Peak memory consumption was 30.2 MB. Max. memory is 11.5 GB. [2019-10-22 11:26:42,685 INFO L168 Benchmark]: Boogie Procedure Inliner took 57.34 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-10-22 11:26:42,686 INFO L168 Benchmark]: Boogie Preprocessor took 37.61 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:26:42,687 INFO L168 Benchmark]: RCFGBuilder took 685.80 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 39.5 MB). Peak memory consumption was 39.5 MB. Max. memory is 11.5 GB. [2019-10-22 11:26:42,687 INFO L168 Benchmark]: TraceAbstraction took 347.75 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. [2019-10-22 11:26:42,690 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 977.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 680.93 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -156.1 MB). Peak memory consumption was 30.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 57.34 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 37.61 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 685.80 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 39.5 MB). Peak memory consumption was 39.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 347.75 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: Sort FloatRoundingMode not declared de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Sort FloatRoundingMode not declared: de.uni_freiburg.informatik.ultimate.logic.NoopScript.sort(NoopScript.java:412) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...