./Ultimate.py --spec /storage/repos/svcomp/c/properties/valid-memsafety.prp --file /storage/repos/svcomp/c/array-memsafety/openbsd_cstrcspn-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/svcomp/c/array-memsafety/openbsd_cstrcspn-alloca_true-valid-memsafety_true-termination.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b05f69771eccbce2f5fc7c2cfa048f17b18a2bd9 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/svcomp/c/array-memsafety/openbsd_cstrcspn-alloca_true-valid-memsafety_true-termination.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b05f69771eccbce2f5fc7c2cfa048f17b18a2bd9 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: NullPointerException: null --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 17:13:22,921 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 17:13:22,924 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 17:13:22,943 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 17:13:22,943 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 17:13:22,945 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 17:13:22,946 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 17:13:22,949 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 17:13:22,952 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 17:13:22,953 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 17:13:22,955 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 17:13:22,957 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 17:13:22,958 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 17:13:22,961 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 17:13:22,969 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 17:13:22,969 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 17:13:22,970 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 17:13:22,975 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 17:13:22,977 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 17:13:22,979 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 17:13:22,980 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 17:13:22,981 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 17:13:22,983 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 17:13:22,984 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 17:13:22,984 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 17:13:22,985 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 17:13:22,987 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 17:13:22,988 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 17:13:22,989 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 17:13:22,990 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 17:13:22,990 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 17:13:22,991 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 17:13:22,991 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 17:13:22,991 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 17:13:22,992 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 17:13:22,994 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 17:13:22,995 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-01-01 17:13:23,019 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 17:13:23,019 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 17:13:23,020 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 17:13:23,021 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 17:13:23,021 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 17:13:23,021 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 17:13:23,021 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 17:13:23,021 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 17:13:23,021 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 17:13:23,022 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 17:13:23,022 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 17:13:23,022 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-01-01 17:13:23,022 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2019-01-01 17:13:23,022 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-01-01 17:13:23,022 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-01 17:13:23,023 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 17:13:23,023 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 17:13:23,023 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 17:13:23,023 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 17:13:23,023 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-01 17:13:23,023 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-01 17:13:23,024 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-01 17:13:23,024 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 17:13:23,024 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-01 17:13:23,024 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 17:13:23,024 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-01 17:13:23,024 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G 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 -> Automizer 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 -> b05f69771eccbce2f5fc7c2cfa048f17b18a2bd9 [2019-01-01 17:13:23,063 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 17:13:23,075 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 17:13:23,080 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 17:13:23,082 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 17:13:23,082 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 17:13:23,083 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/array-memsafety/openbsd_cstrcspn-alloca_true-valid-memsafety_true-termination.i [2019-01-01 17:13:23,137 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3f113c4b/8a96c2882ace43b2a5606ceebfc441d3/FLAG1bdb17abb [2019-01-01 17:13:23,609 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 17:13:23,610 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/array-memsafety/openbsd_cstrcspn-alloca_true-valid-memsafety_true-termination.i [2019-01-01 17:13:23,623 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3f113c4b/8a96c2882ace43b2a5606ceebfc441d3/FLAG1bdb17abb [2019-01-01 17:13:23,921 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3f113c4b/8a96c2882ace43b2a5606ceebfc441d3 [2019-01-01 17:13:23,925 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 17:13:23,927 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-01-01 17:13:23,928 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 17:13:23,928 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 17:13:23,933 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 17:13:23,934 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 05:13:23" (1/1) ... [2019-01-01 17:13:23,938 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25006409 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:13:23, skipping insertion in model container [2019-01-01 17:13:23,938 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 05:13:23" (1/1) ... [2019-01-01 17:13:23,948 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 17:13:24,001 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 17:13:24,424 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 17:13:24,444 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 17:13:24,525 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 17:13:24,712 INFO L195 MainTranslator]: Completed translation [2019-01-01 17:13:24,713 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:13:24 WrapperNode [2019-01-01 17:13:24,713 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 17:13:24,714 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 17:13:24,714 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 17:13:24,715 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 17:13:24,732 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:13:24" (1/1) ... [2019-01-01 17:13:24,733 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:13:24" (1/1) ... [2019-01-01 17:13:24,756 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:13:24" (1/1) ... [2019-01-01 17:13:24,758 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:13:24" (1/1) ... [2019-01-01 17:13:24,786 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:13:24" (1/1) ... [2019-01-01 17:13:24,794 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:13:24" (1/1) ... [2019-01-01 17:13:24,798 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:13:24" (1/1) ... [2019-01-01 17:13:24,815 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 17:13:24,816 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 17:13:24,816 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 17:13:24,816 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 17:13:24,821 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:13:24" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-01-01 17:13:24,892 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-01-01 17:13:24,892 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 17:13:24,892 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-01-01 17:13:24,892 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-01-01 17:13:24,893 INFO L138 BoogieDeclarations]: Found implementation of procedure cstrcspn [2019-01-01 17:13:24,893 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-01 17:13:24,893 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-01-01 17:13:24,893 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-01-01 17:13:24,893 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-01-01 17:13:24,893 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-01-01 17:13:24,894 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-01-01 17:13:24,894 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-01-01 17:13:24,894 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-01-01 17:13:24,894 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-01-01 17:13:24,894 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-01-01 17:13:24,894 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-01-01 17:13:24,896 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-01-01 17:13:24,897 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-01-01 17:13:24,897 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-01-01 17:13:24,898 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-01-01 17:13:24,898 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-01-01 17:13:24,898 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-01-01 17:13:24,898 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-01-01 17:13:24,899 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-01-01 17:13:24,899 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-01-01 17:13:24,899 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-01-01 17:13:24,899 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-01-01 17:13:24,899 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-01-01 17:13:24,899 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-01-01 17:13:24,901 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-01-01 17:13:24,901 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-01-01 17:13:24,902 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-01-01 17:13:24,902 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-01-01 17:13:24,902 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-01-01 17:13:24,902 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-01-01 17:13:24,902 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-01-01 17:13:24,902 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-01-01 17:13:24,904 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-01-01 17:13:24,904 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-01-01 17:13:24,905 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-01-01 17:13:24,905 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-01-01 17:13:24,905 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-01-01 17:13:24,906 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-01-01 17:13:24,906 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-01-01 17:13:24,906 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-01-01 17:13:24,906 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-01-01 17:13:24,907 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-01-01 17:13:24,907 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-01-01 17:13:24,907 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-01-01 17:13:24,907 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-01-01 17:13:24,907 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-01-01 17:13:24,907 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-01-01 17:13:24,907 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-01-01 17:13:24,909 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-01-01 17:13:24,909 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-01-01 17:13:24,909 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-01-01 17:13:24,910 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-01-01 17:13:24,910 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-01-01 17:13:24,910 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-01-01 17:13:24,910 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-01-01 17:13:24,910 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-01-01 17:13:24,910 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-01-01 17:13:24,910 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-01-01 17:13:24,914 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-01-01 17:13:24,914 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-01-01 17:13:24,914 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-01-01 17:13:24,914 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-01-01 17:13:24,914 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-01-01 17:13:24,914 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-01-01 17:13:24,915 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-01-01 17:13:24,915 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-01-01 17:13:24,915 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-01-01 17:13:24,915 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-01-01 17:13:24,915 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-01-01 17:13:24,915 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-01-01 17:13:24,915 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-01-01 17:13:24,916 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-01-01 17:13:24,918 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-01-01 17:13:24,918 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-01-01 17:13:24,919 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-01-01 17:13:24,919 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-01-01 17:13:24,920 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-01-01 17:13:24,921 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-01-01 17:13:24,921 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-01-01 17:13:24,921 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-01-01 17:13:24,921 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-01-01 17:13:24,922 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-01-01 17:13:24,922 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-01-01 17:13:24,922 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-01-01 17:13:24,922 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-01-01 17:13:24,922 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-01-01 17:13:24,922 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-01-01 17:13:24,923 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-01-01 17:13:24,923 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-01-01 17:13:24,923 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-01-01 17:13:24,923 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-01-01 17:13:24,923 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-01-01 17:13:24,923 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-01-01 17:13:24,923 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-01-01 17:13:24,923 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-01-01 17:13:24,924 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-01-01 17:13:24,924 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-01-01 17:13:24,924 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-01-01 17:13:24,924 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-01-01 17:13:24,924 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-01-01 17:13:24,924 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-01-01 17:13:24,924 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-01-01 17:13:24,924 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-01-01 17:13:24,927 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-01-01 17:13:24,927 INFO L130 BoogieDeclarations]: Found specification of procedure cstrcspn [2019-01-01 17:13:24,927 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-01 17:13:24,927 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-01 17:13:24,928 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 17:13:24,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-01 17:13:24,928 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-01 17:13:24,928 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-01-01 17:13:24,928 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 17:13:25,617 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 17:13:25,618 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2019-01-01 17:13:25,618 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 05:13:25 BoogieIcfgContainer [2019-01-01 17:13:25,618 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 17:13:25,619 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-01 17:13:25,619 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-01 17:13:25,622 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-01 17:13:25,623 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.01 05:13:23" (1/3) ... [2019-01-01 17:13:25,623 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73ac4357 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 05:13:25, skipping insertion in model container [2019-01-01 17:13:25,624 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:13:24" (2/3) ... [2019-01-01 17:13:25,624 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73ac4357 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 05:13:25, skipping insertion in model container [2019-01-01 17:13:25,624 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 05:13:25" (3/3) ... [2019-01-01 17:13:25,626 INFO L112 eAbstractionObserver]: Analyzing ICFG openbsd_cstrcspn-alloca_true-valid-memsafety_true-termination.i [2019-01-01 17:13:25,636 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-01 17:13:25,646 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2019-01-01 17:13:25,662 INFO L257 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2019-01-01 17:13:25,690 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 17:13:25,691 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-01 17:13:25,691 INFO L383 AbstractCegarLoop]: Hoare is false [2019-01-01 17:13:25,692 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-01 17:13:25,692 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 17:13:25,692 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 17:13:25,692 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-01 17:13:25,692 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 17:13:25,692 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-01 17:13:25,709 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states. [2019-01-01 17:13:25,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-01 17:13:25,720 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:13:25,721 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:13:25,724 INFO L423 AbstractCegarLoop]: === Iteration 1 === [cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2019-01-01 17:13:25,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:13:25,731 INFO L82 PathProgramCache]: Analyzing trace with hash 1757851682, now seen corresponding path program 1 times [2019-01-01 17:13:25,733 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:13:25,733 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:13:25,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:25,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:13:25,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:25,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:13:25,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:13:25,945 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:13:25,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 17:13:25,949 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 17:13:25,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 17:13:25,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 17:13:25,966 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 3 states. [2019-01-01 17:13:26,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:13:26,085 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2019-01-01 17:13:26,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 17:13:26,087 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-01-01 17:13:26,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:13:26,097 INFO L225 Difference]: With dead ends: 36 [2019-01-01 17:13:26,098 INFO L226 Difference]: Without dead ends: 33 [2019-01-01 17:13:26,100 INFO L631 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-01-01 17:13:26,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-01-01 17:13:26,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-01-01 17:13:26,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-01-01 17:13:26,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2019-01-01 17:13:26,142 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 10 [2019-01-01 17:13:26,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:13:26,142 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2019-01-01 17:13:26,142 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 17:13:26,143 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2019-01-01 17:13:26,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-01 17:13:26,143 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:13:26,143 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:13:26,144 INFO L423 AbstractCegarLoop]: === Iteration 2 === [cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2019-01-01 17:13:26,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:13:26,144 INFO L82 PathProgramCache]: Analyzing trace with hash 1757851683, now seen corresponding path program 1 times [2019-01-01 17:13:26,144 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:13:26,145 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:13:26,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:26,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:13:26,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:26,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:13:26,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:13:26,305 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:13:26,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 17:13:26,307 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-01 17:13:26,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 17:13:26,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-01 17:13:26,307 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand 4 states. [2019-01-01 17:13:26,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:13:26,377 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2019-01-01 17:13:26,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 17:13:26,377 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-01-01 17:13:26,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:13:26,378 INFO L225 Difference]: With dead ends: 32 [2019-01-01 17:13:26,379 INFO L226 Difference]: Without dead ends: 32 [2019-01-01 17:13:26,380 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-01 17:13:26,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-01-01 17:13:26,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-01-01 17:13:26,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-01 17:13:26,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2019-01-01 17:13:26,385 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 10 [2019-01-01 17:13:26,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:13:26,385 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2019-01-01 17:13:26,386 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-01 17:13:26,386 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2019-01-01 17:13:26,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-01 17:13:26,387 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:13:26,387 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:13:26,387 INFO L423 AbstractCegarLoop]: === Iteration 3 === [cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2019-01-01 17:13:26,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:13:26,388 INFO L82 PathProgramCache]: Analyzing trace with hash -1341172715, now seen corresponding path program 1 times [2019-01-01 17:13:26,388 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:13:26,388 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:13:26,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:26,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:13:26,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:26,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:13:26,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:13:26,449 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:13:26,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 17:13:26,451 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 17:13:26,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 17:13:26,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 17:13:26,452 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand 3 states. [2019-01-01 17:13:26,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:13:26,501 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2019-01-01 17:13:26,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 17:13:26,502 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-01-01 17:13:26,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:13:26,503 INFO L225 Difference]: With dead ends: 31 [2019-01-01 17:13:26,504 INFO L226 Difference]: Without dead ends: 31 [2019-01-01 17:13:26,505 INFO L631 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-01-01 17:13:26,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-01-01 17:13:26,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-01-01 17:13:26,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-01 17:13:26,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2019-01-01 17:13:26,510 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 11 [2019-01-01 17:13:26,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:13:26,511 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2019-01-01 17:13:26,511 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 17:13:26,511 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2019-01-01 17:13:26,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-01 17:13:26,513 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:13:26,513 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:13:26,514 INFO L423 AbstractCegarLoop]: === Iteration 4 === [cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2019-01-01 17:13:26,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:13:26,515 INFO L82 PathProgramCache]: Analyzing trace with hash -1341172714, now seen corresponding path program 1 times [2019-01-01 17:13:26,515 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:13:26,515 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:13:26,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:26,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:13:26,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:26,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:13:26,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:13:26,677 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:13:26,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 17:13:26,677 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-01 17:13:26,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 17:13:26,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-01 17:13:26,678 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand 4 states. [2019-01-01 17:13:26,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:13:26,706 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2019-01-01 17:13:26,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 17:13:26,707 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-01-01 17:13:26,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:13:26,708 INFO L225 Difference]: With dead ends: 30 [2019-01-01 17:13:26,708 INFO L226 Difference]: Without dead ends: 30 [2019-01-01 17:13:26,709 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-01 17:13:26,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-01-01 17:13:26,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-01-01 17:13:26,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-01 17:13:26,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2019-01-01 17:13:26,713 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 11 [2019-01-01 17:13:26,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:13:26,714 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2019-01-01 17:13:26,714 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-01 17:13:26,714 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2019-01-01 17:13:26,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-01 17:13:26,715 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:13:26,715 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:13:26,715 INFO L423 AbstractCegarLoop]: === Iteration 5 === [cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2019-01-01 17:13:26,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:13:26,715 INFO L82 PathProgramCache]: Analyzing trace with hash -1317020149, now seen corresponding path program 1 times [2019-01-01 17:13:26,716 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:13:26,716 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:13:26,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:26,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:13:26,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:26,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:13:26,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:13:26,817 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:13:26,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 17:13:26,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 17:13:26,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 17:13:26,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-01 17:13:26,818 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand 6 states. [2019-01-01 17:13:27,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:13:27,025 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2019-01-01 17:13:27,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 17:13:27,026 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2019-01-01 17:13:27,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:13:27,027 INFO L225 Difference]: With dead ends: 29 [2019-01-01 17:13:27,027 INFO L226 Difference]: Without dead ends: 29 [2019-01-01 17:13:27,028 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-01 17:13:27,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-01-01 17:13:27,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-01-01 17:13:27,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-01 17:13:27,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2019-01-01 17:13:27,032 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 15 [2019-01-01 17:13:27,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:13:27,033 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2019-01-01 17:13:27,033 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 17:13:27,033 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2019-01-01 17:13:27,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-01 17:13:27,034 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:13:27,034 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:13:27,034 INFO L423 AbstractCegarLoop]: === Iteration 6 === [cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2019-01-01 17:13:27,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:13:27,035 INFO L82 PathProgramCache]: Analyzing trace with hash -1317020148, now seen corresponding path program 1 times [2019-01-01 17:13:27,035 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:13:27,035 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:13:27,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:27,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:13:27,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:27,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:13:27,333 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 7 [2019-01-01 17:13:27,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:13:27,481 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:13:27,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-01 17:13:27,482 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-01 17:13:27,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-01 17:13:27,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-01-01 17:13:27,483 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand 8 states. [2019-01-01 17:13:27,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:13:27,719 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2019-01-01 17:13:27,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 17:13:27,720 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2019-01-01 17:13:27,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:13:27,721 INFO L225 Difference]: With dead ends: 32 [2019-01-01 17:13:27,721 INFO L226 Difference]: Without dead ends: 32 [2019-01-01 17:13:27,722 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-01-01 17:13:27,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-01-01 17:13:27,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2019-01-01 17:13:27,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-01 17:13:27,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2019-01-01 17:13:27,729 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 15 [2019-01-01 17:13:27,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:13:27,729 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2019-01-01 17:13:27,729 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-01 17:13:27,729 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2019-01-01 17:13:27,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-01 17:13:27,730 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:13:27,730 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:13:27,730 INFO L423 AbstractCegarLoop]: === Iteration 7 === [cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2019-01-01 17:13:27,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:13:27,731 INFO L82 PathProgramCache]: Analyzing trace with hash -820999840, now seen corresponding path program 1 times [2019-01-01 17:13:27,731 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:13:27,731 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:13:27,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:27,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:13:27,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:27,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:13:27,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:13:27,884 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:13:27,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 17:13:27,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-01 17:13:27,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 17:13:27,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-01 17:13:27,886 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand 7 states. [2019-01-01 17:13:28,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:13:28,105 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2019-01-01 17:13:28,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 17:13:28,108 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2019-01-01 17:13:28,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:13:28,109 INFO L225 Difference]: With dead ends: 31 [2019-01-01 17:13:28,109 INFO L226 Difference]: Without dead ends: 31 [2019-01-01 17:13:28,109 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-01-01 17:13:28,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-01-01 17:13:28,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2019-01-01 17:13:28,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-01 17:13:28,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2019-01-01 17:13:28,113 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 18 [2019-01-01 17:13:28,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:13:28,113 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2019-01-01 17:13:28,114 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-01 17:13:28,115 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2019-01-01 17:13:28,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-01 17:13:28,115 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:13:28,115 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:13:28,116 INFO L423 AbstractCegarLoop]: === Iteration 8 === [cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2019-01-01 17:13:28,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:13:28,116 INFO L82 PathProgramCache]: Analyzing trace with hash -820999839, now seen corresponding path program 1 times [2019-01-01 17:13:28,116 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:13:28,116 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:13:28,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:28,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:13:28,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:28,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:13:28,320 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-01-01 17:13:28,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:13:28,457 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:13:28,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-01 17:13:28,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-01 17:13:28,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-01 17:13:28,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-01-01 17:13:28,458 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand 9 states. [2019-01-01 17:13:28,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:13:28,657 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2019-01-01 17:13:28,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-01 17:13:28,658 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2019-01-01 17:13:28,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:13:28,659 INFO L225 Difference]: With dead ends: 34 [2019-01-01 17:13:28,659 INFO L226 Difference]: Without dead ends: 34 [2019-01-01 17:13:28,660 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-01-01 17:13:28,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-01-01 17:13:28,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2019-01-01 17:13:28,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-01 17:13:28,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2019-01-01 17:13:28,666 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 18 [2019-01-01 17:13:28,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:13:28,668 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2019-01-01 17:13:28,668 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-01 17:13:28,668 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2019-01-01 17:13:28,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-01 17:13:28,669 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:13:28,669 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:13:28,669 INFO L423 AbstractCegarLoop]: === Iteration 9 === [cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2019-01-01 17:13:28,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:13:28,671 INFO L82 PathProgramCache]: Analyzing trace with hash -2018091976, now seen corresponding path program 1 times [2019-01-01 17:13:28,672 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:13:28,672 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:13:28,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:28,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:13:28,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:28,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:13:28,914 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:13:28,915 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:13:28,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-01-01 17:13:28,915 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-01 17:13:28,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-01 17:13:28,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-01-01 17:13:28,916 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand 11 states. [2019-01-01 17:13:29,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:13:29,247 INFO L93 Difference]: Finished difference Result 56 states and 60 transitions. [2019-01-01 17:13:29,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-01 17:13:29,249 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 23 [2019-01-01 17:13:29,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:13:29,250 INFO L225 Difference]: With dead ends: 56 [2019-01-01 17:13:29,250 INFO L226 Difference]: Without dead ends: 56 [2019-01-01 17:13:29,253 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2019-01-01 17:13:29,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-01-01 17:13:29,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 50. [2019-01-01 17:13:29,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-01-01 17:13:29,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2019-01-01 17:13:29,272 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 23 [2019-01-01 17:13:29,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:13:29,272 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2019-01-01 17:13:29,272 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-01 17:13:29,273 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2019-01-01 17:13:29,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-01 17:13:29,275 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:13:29,275 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:13:29,275 INFO L423 AbstractCegarLoop]: === Iteration 10 === [cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2019-01-01 17:13:29,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:13:29,278 INFO L82 PathProgramCache]: Analyzing trace with hash -2018089798, now seen corresponding path program 1 times [2019-01-01 17:13:29,278 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:13:29,278 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:13:29,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:29,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:13:29,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:29,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:13:29,541 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:13:29,541 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:13:29,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-01-01 17:13:29,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-01 17:13:29,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-01 17:13:29,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-01-01 17:13:29,542 INFO L87 Difference]: Start difference. First operand 50 states and 56 transitions. Second operand 11 states. [2019-01-01 17:13:30,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:13:30,071 INFO L93 Difference]: Finished difference Result 94 states and 100 transitions. [2019-01-01 17:13:30,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-01 17:13:30,072 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 23 [2019-01-01 17:13:30,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:13:30,075 INFO L225 Difference]: With dead ends: 94 [2019-01-01 17:13:30,076 INFO L226 Difference]: Without dead ends: 93 [2019-01-01 17:13:30,076 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2019-01-01 17:13:30,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-01-01 17:13:30,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 81. [2019-01-01 17:13:30,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-01-01 17:13:30,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 89 transitions. [2019-01-01 17:13:30,086 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 89 transitions. Word has length 23 [2019-01-01 17:13:30,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:13:30,087 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 89 transitions. [2019-01-01 17:13:30,087 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-01 17:13:30,087 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 89 transitions. [2019-01-01 17:13:30,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-01 17:13:30,088 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:13:30,088 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:13:30,090 INFO L423 AbstractCegarLoop]: === Iteration 11 === [cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2019-01-01 17:13:30,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:13:30,090 INFO L82 PathProgramCache]: Analyzing trace with hash 1255809144, now seen corresponding path program 1 times [2019-01-01 17:13:30,090 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:13:30,090 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:13:30,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:30,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:13:30,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:30,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:13:30,530 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:13:30,530 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 17:13:30,530 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 17:13:30,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:13:30,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:13:30,603 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 17:13:30,662 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-01 17:13:30,672 INFO L478 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 11 treesize of output 10 [2019-01-01 17:13:30,672 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:13:30,675 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:13:30,686 INFO L267 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-01-01 17:13:30,686 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2019-01-01 17:13:31,160 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2019-01-01 17:13:31,174 INFO L478 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 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2019-01-01 17:13:31,175 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-01 17:13:31,184 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 17:13:31,204 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-01 17:13:31,211 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:29 [2019-01-01 17:13:31,380 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:13:31,408 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 17:13:31,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 19 [2019-01-01 17:13:31,409 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-01-01 17:13:31,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-01-01 17:13:31,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=336, Unknown=0, NotChecked=0, Total=380 [2019-01-01 17:13:31,410 INFO L87 Difference]: Start difference. First operand 81 states and 89 transitions. Second operand 20 states. [2019-01-01 17:13:32,268 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 60 [2019-01-01 17:13:32,428 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2019-01-01 17:13:32,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:13:32,994 INFO L93 Difference]: Finished difference Result 105 states and 118 transitions. [2019-01-01 17:13:32,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-01 17:13:32,994 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 23 [2019-01-01 17:13:32,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:13:32,996 INFO L225 Difference]: With dead ends: 105 [2019-01-01 17:13:32,997 INFO L226 Difference]: Without dead ends: 105 [2019-01-01 17:13:32,998 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=156, Invalid=774, Unknown=0, NotChecked=0, Total=930 [2019-01-01 17:13:32,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-01-01 17:13:33,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 91. [2019-01-01 17:13:33,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-01-01 17:13:33,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 102 transitions. [2019-01-01 17:13:33,011 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 102 transitions. Word has length 23 [2019-01-01 17:13:33,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:13:33,012 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 102 transitions. [2019-01-01 17:13:33,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-01-01 17:13:33,013 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 102 transitions. [2019-01-01 17:13:33,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-01 17:13:33,014 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:13:33,014 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:13:33,014 INFO L423 AbstractCegarLoop]: === Iteration 12 === [cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2019-01-01 17:13:33,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:13:33,014 INFO L82 PathProgramCache]: Analyzing trace with hash 688527418, now seen corresponding path program 1 times [2019-01-01 17:13:33,015 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:13:33,016 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:13:33,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:33,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:13:33,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:33,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:13:33,772 WARN L181 SmtUtils]: Spent 554.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 19 [2019-01-01 17:13:33,955 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 26 [2019-01-01 17:13:34,134 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:13:34,134 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 17:13:34,134 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 17:13:34,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:13:34,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:13:34,182 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 17:13:34,295 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 5 treesize of output 1 [2019-01-01 17:13:34,296 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 17:13:34,355 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:13:34,356 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2019-01-01 17:13:34,416 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-01 17:13:34,419 INFO L478 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 11 treesize of output 10 [2019-01-01 17:13:34,419 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:13:34,421 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:13:34,431 INFO L267 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-01-01 17:13:34,432 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2019-01-01 17:13:34,480 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 26 [2019-01-01 17:13:34,484 INFO L478 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 11 treesize of output 10 [2019-01-01 17:13:34,485 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:13:34,497 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:13:34,515 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-01 17:13:34,516 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2019-01-01 17:13:34,724 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2019-01-01 17:13:34,731 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2019-01-01 17:13:34,731 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:13:34,756 INFO L478 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 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2019-01-01 17:13:34,756 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2019-01-01 17:13:34,762 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 17:13:34,781 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-01 17:13:34,781 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:52, output treesize:29 [2019-01-01 17:13:34,958 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:13:34,977 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 17:13:34,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 21 [2019-01-01 17:13:34,978 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-01-01 17:13:34,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-01-01 17:13:34,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=410, Unknown=0, NotChecked=0, Total=462 [2019-01-01 17:13:34,980 INFO L87 Difference]: Start difference. First operand 91 states and 102 transitions. Second operand 22 states. [2019-01-01 17:13:36,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:13:36,433 INFO L93 Difference]: Finished difference Result 121 states and 137 transitions. [2019-01-01 17:13:36,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-01 17:13:36,434 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 23 [2019-01-01 17:13:36,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:13:36,436 INFO L225 Difference]: With dead ends: 121 [2019-01-01 17:13:36,436 INFO L226 Difference]: Without dead ends: 121 [2019-01-01 17:13:36,438 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=140, Invalid=916, Unknown=0, NotChecked=0, Total=1056 [2019-01-01 17:13:36,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-01-01 17:13:36,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 114. [2019-01-01 17:13:36,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-01-01 17:13:36,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 131 transitions. [2019-01-01 17:13:36,449 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 131 transitions. Word has length 23 [2019-01-01 17:13:36,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:13:36,450 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 131 transitions. [2019-01-01 17:13:36,450 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-01-01 17:13:36,450 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 131 transitions. [2019-01-01 17:13:36,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-01 17:13:36,451 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:13:36,451 INFO L402 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-01-01 17:13:36,451 INFO L423 AbstractCegarLoop]: === Iteration 13 === [cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2019-01-01 17:13:36,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:13:36,454 INFO L82 PathProgramCache]: Analyzing trace with hash 1863036971, now seen corresponding path program 1 times [2019-01-01 17:13:36,454 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:13:36,454 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:13:36,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:36,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:13:36,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:36,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:13:36,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:13:36,611 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:13:36,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 17:13:36,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-01 17:13:36,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 17:13:36,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 17:13:36,614 INFO L87 Difference]: Start difference. First operand 114 states and 131 transitions. Second operand 4 states. [2019-01-01 17:13:36,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:13:36,658 INFO L93 Difference]: Finished difference Result 113 states and 130 transitions. [2019-01-01 17:13:36,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 17:13:36,659 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-01-01 17:13:36,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:13:36,660 INFO L225 Difference]: With dead ends: 113 [2019-01-01 17:13:36,660 INFO L226 Difference]: Without dead ends: 91 [2019-01-01 17:13:36,661 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 17:13:36,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-01-01 17:13:36,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-01-01 17:13:36,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-01-01 17:13:36,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 100 transitions. [2019-01-01 17:13:36,667 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 100 transitions. Word has length 24 [2019-01-01 17:13:36,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:13:36,667 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 100 transitions. [2019-01-01 17:13:36,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-01 17:13:36,667 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 100 transitions. [2019-01-01 17:13:36,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-01-01 17:13:36,668 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:13:36,669 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:13:36,669 INFO L423 AbstractCegarLoop]: === Iteration 14 === [cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2019-01-01 17:13:36,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:13:36,669 INFO L82 PathProgramCache]: Analyzing trace with hash -728587261, now seen corresponding path program 2 times [2019-01-01 17:13:36,669 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:13:36,669 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:13:36,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:36,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:13:36,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:36,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:13:37,046 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:13:37,046 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 17:13:37,046 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 17:13:37,058 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 17:13:37,084 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-01 17:13:37,084 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 17:13:37,088 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 17:13:37,092 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2019-01-01 17:13:37,113 INFO L478 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 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 15 [2019-01-01 17:13:37,114 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-01 17:13:37,129 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 17:13:37,143 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:13:37,144 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2019-01-01 17:13:37,319 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-01-01 17:13:37,321 INFO L478 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 13 treesize of output 12 [2019-01-01 17:13:37,322 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:13:37,324 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:13:37,330 INFO L267 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-01-01 17:13:37,331 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:19 [2019-01-01 17:13:37,589 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2019-01-01 17:13:37,701 INFO L478 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 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 15 [2019-01-01 17:13:37,702 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-01 17:13:37,716 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 17:13:37,729 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-01 17:13:37,729 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:37 [2019-01-01 17:13:37,844 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:13:37,872 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 17:13:37,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 23 [2019-01-01 17:13:37,873 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-01-01 17:13:37,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-01-01 17:13:37,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=494, Unknown=0, NotChecked=0, Total=552 [2019-01-01 17:13:37,876 INFO L87 Difference]: Start difference. First operand 91 states and 100 transitions. Second operand 24 states. [2019-01-01 17:13:39,107 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 59 [2019-01-01 17:13:39,734 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 58 [2019-01-01 17:13:39,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:13:39,801 INFO L93 Difference]: Finished difference Result 102 states and 109 transitions. [2019-01-01 17:13:39,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-01-01 17:13:39,802 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 28 [2019-01-01 17:13:39,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:13:39,803 INFO L225 Difference]: With dead ends: 102 [2019-01-01 17:13:39,804 INFO L226 Difference]: Without dead ends: 79 [2019-01-01 17:13:39,805 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=255, Invalid=1305, Unknown=0, NotChecked=0, Total=1560 [2019-01-01 17:13:39,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-01-01 17:13:39,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 55. [2019-01-01 17:13:39,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-01-01 17:13:39,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2019-01-01 17:13:39,811 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 28 [2019-01-01 17:13:39,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:13:39,811 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2019-01-01 17:13:39,811 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-01-01 17:13:39,811 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2019-01-01 17:13:39,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-01-01 17:13:39,813 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:13:39,813 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:13:39,813 INFO L423 AbstractCegarLoop]: === Iteration 15 === [cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2019-01-01 17:13:39,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:13:39,813 INFO L82 PathProgramCache]: Analyzing trace with hash -88962970, now seen corresponding path program 2 times [2019-01-01 17:13:39,813 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:13:39,817 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:13:39,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:39,818 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 17:13:39,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:39,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:13:40,280 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:13:40,280 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 17:13:40,280 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 17:13:40,298 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 17:13:40,324 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-01 17:13:40,324 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 17:13:40,330 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 17:13:40,438 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 5 treesize of output 1 [2019-01-01 17:13:40,439 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 17:13:40,449 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2019-01-01 17:13:40,459 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 12 treesize of output 15 [2019-01-01 17:13:40,460 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-01 17:13:40,464 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:13:40,473 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:13:40,473 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:21, output treesize:18 [2019-01-01 17:13:40,500 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-01-01 17:13:40,504 INFO L478 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 13 treesize of output 12 [2019-01-01 17:13:40,504 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:13:40,505 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:13:40,514 INFO L267 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-01-01 17:13:40,514 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2019-01-01 17:13:40,550 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2019-01-01 17:13:40,555 INFO L478 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 13 treesize of output 12 [2019-01-01 17:13:40,555 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:13:40,561 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:13:40,574 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-01 17:13:40,575 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:35 [2019-01-01 17:13:40,923 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2019-01-01 17:13:40,925 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 1 [2019-01-01 17:13:40,926 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:13:41,032 INFO L478 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 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 15 [2019-01-01 17:13:41,033 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2019-01-01 17:13:41,036 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 17:13:41,051 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-01 17:13:41,051 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:52, output treesize:37 [2019-01-01 17:13:41,224 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:13:41,243 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 17:13:41,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 24 [2019-01-01 17:13:41,243 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-01-01 17:13:41,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-01-01 17:13:41,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=537, Unknown=0, NotChecked=0, Total=600 [2019-01-01 17:13:41,244 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand 25 states. [2019-01-01 17:13:43,559 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 51 [2019-01-01 17:13:43,743 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 55 [2019-01-01 17:13:45,667 WARN L181 SmtUtils]: Spent 1.86 s on a formula simplification. DAG size of input: 60 DAG size of output: 49 [2019-01-01 17:13:46,261 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 43 [2019-01-01 17:13:47,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:13:47,647 INFO L93 Difference]: Finished difference Result 59 states and 62 transitions. [2019-01-01 17:13:47,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-01 17:13:47,648 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 31 [2019-01-01 17:13:47,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:13:47,648 INFO L225 Difference]: With dead ends: 59 [2019-01-01 17:13:47,648 INFO L226 Difference]: Without dead ends: 0 [2019-01-01 17:13:47,651 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=197, Invalid=1285, Unknown=0, NotChecked=0, Total=1482 [2019-01-01 17:13:47,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-01 17:13:47,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-01 17:13:47,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-01 17:13:47,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-01 17:13:47,652 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 31 [2019-01-01 17:13:47,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:13:47,653 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 17:13:47,654 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-01-01 17:13:47,655 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-01 17:13:47,655 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-01 17:13:47,660 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.01 05:13:47 BoogieIcfgContainer [2019-01-01 17:13:47,660 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-01 17:13:47,660 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 17:13:47,660 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 17:13:47,660 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 17:13:47,662 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 05:13:25" (3/4) ... [2019-01-01 17:13:47,666 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-01 17:13:47,673 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-01-01 17:13:47,673 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure cstrcspn [2019-01-01 17:13:47,673 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2019-01-01 17:13:47,673 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2019-01-01 17:13:47,674 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-01-01 17:13:47,678 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2019-01-01 17:13:47,679 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-01-01 17:13:47,679 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-01-01 17:13:47,719 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.witnessprinter has thrown an exception: java.lang.NullPointerException at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSLBacktranslationValueProvider.getStringFromIASTNode(CACSLBacktranslationValueProvider.java:78) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSLBacktranslationValueProvider.getStringFromStep(CACSLBacktranslationValueProvider.java:59) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSLBacktranslationValueProvider.getStringFromStep(CACSLBacktranslationValueProvider.java:1) at de.uni_freiburg.informatik.ultimate.witnessprinter.graphml.GeneratedWitnessEdge.getSourceCode(GeneratedWitnessEdge.java:153) at de.uni_freiburg.informatik.ultimate.witnessprinter.CorrectnessWitnessGenerator.lambda$2(CorrectnessWitnessGenerator.java:95) at edu.uci.ics.jung.io.GraphMLWriter.writeEdgeData(GraphMLWriter.java:237) at de.uni_freiburg.informatik.ultimate.witnessprinter.graphml.UltimateGraphMLWriter.save(UltimateGraphMLWriter.java:106) at de.uni_freiburg.informatik.ultimate.witnessprinter.CorrectnessWitnessGenerator.makeGraphMLString(CorrectnessWitnessGenerator.java:116) at de.uni_freiburg.informatik.ultimate.witnessprinter.WitnessPrinter.generateProofWitness(WitnessPrinter.java:165) at de.uni_freiburg.informatik.ultimate.witnessprinter.WitnessPrinter.finish(WitnessPrinter.java:145) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:131) 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-01-01 17:13:47,727 INFO L168 Benchmark]: Toolchain (without parser) took 23800.84 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 314.6 MB). Free memory was 951.4 MB in the beginning and 980.2 MB in the end (delta: -28.8 MB). Peak memory consumption was 285.7 MB. Max. memory is 11.5 GB. [2019-01-01 17:13:47,728 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 17:13:47,728 INFO L168 Benchmark]: CACSL2BoogieTranslator took 785.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 164.1 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -198.4 MB). Peak memory consumption was 31.4 MB. Max. memory is 11.5 GB. [2019-01-01 17:13:47,729 INFO L168 Benchmark]: Boogie Preprocessor took 101.32 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-01-01 17:13:47,731 INFO L168 Benchmark]: RCFGBuilder took 802.33 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: 46.2 MB). Peak memory consumption was 46.2 MB. Max. memory is 11.5 GB. [2019-01-01 17:13:47,731 INFO L168 Benchmark]: TraceAbstraction took 22040.86 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 150.5 MB). Free memory was 1.1 GB in the beginning and 989.0 MB in the end (delta: 107.7 MB). Peak memory consumption was 258.2 MB. Max. memory is 11.5 GB. [2019-01-01 17:13:47,732 INFO L168 Benchmark]: Witness Printer took 65.67 ms. Allocated memory is still 1.3 GB. Free memory was 989.0 MB in the beginning and 980.2 MB in the end (delta: 8.8 MB). Peak memory consumption was 8.8 MB. Max. memory is 11.5 GB. [2019-01-01 17:13:47,738 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 785.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 164.1 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -198.4 MB). Peak memory consumption was 31.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 101.32 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. * RCFGBuilder took 802.33 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: 46.2 MB). Peak memory consumption was 46.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 22040.86 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 150.5 MB). Free memory was 1.1 GB in the beginning and 989.0 MB in the end (delta: 107.7 MB). Peak memory consumption was 258.2 MB. Max. memory is 11.5 GB. * Witness Printer took 65.67 ms. Allocated memory is still 1.3 GB. Free memory was 989.0 MB in the beginning and 980.2 MB in the end (delta: 8.8 MB). Peak memory consumption was 8.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 546]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 546]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 549]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 549]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 565]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 565]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 554]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 566]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 566]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 9 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 43 locations, 9 error locations. SAFE Result, 21.9s OverallTime, 15 OverallIterations, 3 TraceHistogramMax, 13.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 354 SDtfs, 659 SDslu, 1742 SDs, 0 SdLazy, 1748 SolverSat, 154 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 5.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 294 GetRequests, 82 SyntacticMatches, 3 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 660 ImplicationChecksByTransitivity, 12.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=114occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 67 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 7.4s InterpolantComputationTime, 388 NumberOfCodeBlocks, 388 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 369 ConstructedInterpolants, 37 QuantifiedInterpolants, 98714 SizeOfPredicates, 57 NumberOfNonLiveVariables, 619 ConjunctsInSsa, 150 ConjunctsInUnsatCore, 19 InterpolantComputations, 11 PerfectInterpolantSequences, 8/54 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available * Results from de.uni_freiburg.informatik.ultimate.witnessprinter: - ExceptionOrErrorResult: NullPointerException: null de.uni_freiburg.informatik.ultimate.witnessprinter: NullPointerException: null: de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSLBacktranslationValueProvider.getStringFromIASTNode(CACSLBacktranslationValueProvider.java:78) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-2e94e6a [2019-01-01 17:13:50,123 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 17:13:50,125 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 17:13:50,137 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 17:13:50,138 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 17:13:50,139 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 17:13:50,140 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 17:13:50,142 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 17:13:50,144 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 17:13:50,145 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 17:13:50,146 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 17:13:50,146 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 17:13:50,148 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 17:13:50,150 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 17:13:50,152 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 17:13:50,153 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 17:13:50,154 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 17:13:50,156 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 17:13:50,158 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 17:13:50,160 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 17:13:50,162 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 17:13:50,163 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 17:13:50,166 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 17:13:50,166 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 17:13:50,166 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 17:13:50,167 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 17:13:50,169 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 17:13:50,170 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 17:13:50,171 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 17:13:50,172 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 17:13:50,172 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 17:13:50,173 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 17:13:50,174 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 17:13:50,174 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 17:13:50,175 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 17:13:50,176 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 17:13:50,177 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-01-01 17:13:50,204 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 17:13:50,204 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 17:13:50,206 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 17:13:50,206 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 17:13:50,208 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 17:13:50,208 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 17:13:50,208 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 17:13:50,208 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 17:13:50,209 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 17:13:50,210 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 17:13:50,210 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 17:13:50,210 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-01-01 17:13:50,210 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2019-01-01 17:13:50,210 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-01-01 17:13:50,210 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-01 17:13:50,211 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2019-01-01 17:13:50,211 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-01-01 17:13:50,211 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 17:13:50,211 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 17:13:50,211 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 17:13:50,211 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 17:13:50,214 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-01 17:13:50,215 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-01 17:13:50,215 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-01 17:13:50,215 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 17:13:50,215 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-01 17:13:50,216 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2019-01-01 17:13:50,216 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-01 17:13:50,216 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-01-01 17:13:50,216 INFO L133 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G 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 -> Automizer 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 -> b05f69771eccbce2f5fc7c2cfa048f17b18a2bd9 [2019-01-01 17:13:50,285 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 17:13:50,302 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 17:13:50,310 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 17:13:50,312 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 17:13:50,312 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 17:13:50,313 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/array-memsafety/openbsd_cstrcspn-alloca_true-valid-memsafety_true-termination.i [2019-01-01 17:13:50,382 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81e0a71a3/a62814272b6a471498ef509c646f4e94/FLAG59f394770 [2019-01-01 17:13:50,838 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 17:13:50,839 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/array-memsafety/openbsd_cstrcspn-alloca_true-valid-memsafety_true-termination.i [2019-01-01 17:13:50,853 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81e0a71a3/a62814272b6a471498ef509c646f4e94/FLAG59f394770 [2019-01-01 17:13:51,157 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81e0a71a3/a62814272b6a471498ef509c646f4e94 [2019-01-01 17:13:51,161 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 17:13:51,163 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-01-01 17:13:51,164 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 17:13:51,164 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 17:13:51,170 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 17:13:51,171 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 05:13:51" (1/1) ... [2019-01-01 17:13:51,174 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1be35ad7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:13:51, skipping insertion in model container [2019-01-01 17:13:51,175 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 05:13:51" (1/1) ... [2019-01-01 17:13:51,185 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 17:13:51,246 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 17:13:51,645 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 17:13:51,668 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 17:13:51,847 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 17:13:51,919 INFO L195 MainTranslator]: Completed translation [2019-01-01 17:13:51,920 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:13:51 WrapperNode [2019-01-01 17:13:51,920 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 17:13:51,921 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 17:13:51,921 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 17:13:51,922 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 17:13:51,937 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:13:51" (1/1) ... [2019-01-01 17:13:51,937 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:13:51" (1/1) ... [2019-01-01 17:13:51,958 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:13:51" (1/1) ... [2019-01-01 17:13:51,959 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:13:51" (1/1) ... [2019-01-01 17:13:51,976 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:13:51" (1/1) ... [2019-01-01 17:13:51,982 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:13:51" (1/1) ... [2019-01-01 17:13:51,986 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:13:51" (1/1) ... [2019-01-01 17:13:51,992 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 17:13:51,993 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 17:13:51,993 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 17:13:51,993 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 17:13:51,995 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:13:51" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-01-01 17:13:52,062 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-01-01 17:13:52,062 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 17:13:52,062 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-01-01 17:13:52,062 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-01-01 17:13:52,062 INFO L138 BoogieDeclarations]: Found implementation of procedure cstrcspn [2019-01-01 17:13:52,063 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-01 17:13:52,063 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-01-01 17:13:52,063 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-01-01 17:13:52,063 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-01-01 17:13:52,064 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-01-01 17:13:52,065 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-01-01 17:13:52,065 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-01-01 17:13:52,065 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-01-01 17:13:52,065 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-01-01 17:13:52,066 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-01-01 17:13:52,066 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-01-01 17:13:52,066 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-01-01 17:13:52,066 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-01-01 17:13:52,066 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-01-01 17:13:52,067 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-01-01 17:13:52,068 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-01-01 17:13:52,068 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-01-01 17:13:52,068 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-01-01 17:13:52,068 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-01-01 17:13:52,069 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-01-01 17:13:52,069 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-01-01 17:13:52,069 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-01-01 17:13:52,069 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-01-01 17:13:52,069 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-01-01 17:13:52,069 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-01-01 17:13:52,069 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-01-01 17:13:52,071 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-01-01 17:13:52,071 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-01-01 17:13:52,071 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-01-01 17:13:52,071 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-01-01 17:13:52,071 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-01-01 17:13:52,072 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-01-01 17:13:52,072 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-01-01 17:13:52,072 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-01-01 17:13:52,073 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-01-01 17:13:52,073 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-01-01 17:13:52,073 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-01-01 17:13:52,073 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-01-01 17:13:52,073 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-01-01 17:13:52,073 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-01-01 17:13:52,073 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-01-01 17:13:52,073 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-01-01 17:13:52,075 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-01-01 17:13:52,075 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-01-01 17:13:52,075 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-01-01 17:13:52,075 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-01-01 17:13:52,075 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-01-01 17:13:52,075 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-01-01 17:13:52,075 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-01-01 17:13:52,076 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-01-01 17:13:52,076 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-01-01 17:13:52,076 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-01-01 17:13:52,076 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-01-01 17:13:52,076 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-01-01 17:13:52,076 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-01-01 17:13:52,076 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-01-01 17:13:52,077 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-01-01 17:13:52,078 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-01-01 17:13:52,078 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-01-01 17:13:52,078 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-01-01 17:13:52,079 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-01-01 17:13:52,079 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-01-01 17:13:52,079 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-01-01 17:13:52,079 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-01-01 17:13:52,079 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-01-01 17:13:52,079 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-01-01 17:13:52,079 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-01-01 17:13:52,079 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-01-01 17:13:52,080 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-01-01 17:13:52,081 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-01-01 17:13:52,081 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-01-01 17:13:52,081 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-01-01 17:13:52,081 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-01-01 17:13:52,082 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-01-01 17:13:52,082 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-01-01 17:13:52,082 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-01-01 17:13:52,082 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-01-01 17:13:52,082 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-01-01 17:13:52,082 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-01-01 17:13:52,082 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-01-01 17:13:52,084 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-01-01 17:13:52,084 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-01-01 17:13:52,084 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-01-01 17:13:52,084 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-01-01 17:13:52,084 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-01-01 17:13:52,085 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-01-01 17:13:52,085 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-01-01 17:13:52,085 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-01-01 17:13:52,085 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-01-01 17:13:52,086 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-01-01 17:13:52,086 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-01-01 17:13:52,086 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-01-01 17:13:52,086 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-01-01 17:13:52,086 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-01-01 17:13:52,086 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-01-01 17:13:52,086 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-01-01 17:13:52,086 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-01-01 17:13:52,087 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-01-01 17:13:52,087 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-01-01 17:13:52,087 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-01-01 17:13:52,087 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-01-01 17:13:52,087 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-01-01 17:13:52,087 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-01-01 17:13:52,087 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-01-01 17:13:52,087 INFO L130 BoogieDeclarations]: Found specification of procedure cstrcspn [2019-01-01 17:13:52,090 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2019-01-01 17:13:52,090 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-01 17:13:52,090 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 17:13:52,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2019-01-01 17:13:52,090 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-01 17:13:52,090 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-01-01 17:13:52,090 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 17:13:52,952 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 17:13:52,952 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2019-01-01 17:13:52,954 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 05:13:52 BoogieIcfgContainer [2019-01-01 17:13:52,954 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 17:13:52,955 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-01 17:13:52,955 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-01 17:13:52,959 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-01 17:13:52,960 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.01 05:13:51" (1/3) ... [2019-01-01 17:13:52,961 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62907b23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 05:13:52, skipping insertion in model container [2019-01-01 17:13:52,962 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:13:51" (2/3) ... [2019-01-01 17:13:52,962 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62907b23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 05:13:52, skipping insertion in model container [2019-01-01 17:13:52,963 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 05:13:52" (3/3) ... [2019-01-01 17:13:52,965 INFO L112 eAbstractionObserver]: Analyzing ICFG openbsd_cstrcspn-alloca_true-valid-memsafety_true-termination.i [2019-01-01 17:13:52,976 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-01 17:13:52,987 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2019-01-01 17:13:53,006 INFO L257 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2019-01-01 17:13:53,037 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 17:13:53,038 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-01 17:13:53,039 INFO L383 AbstractCegarLoop]: Hoare is false [2019-01-01 17:13:53,039 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-01 17:13:53,040 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 17:13:53,040 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 17:13:53,040 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-01 17:13:53,040 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 17:13:53,040 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-01 17:13:53,057 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states. [2019-01-01 17:13:53,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-01 17:13:53,068 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:13:53,069 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:13:53,072 INFO L423 AbstractCegarLoop]: === Iteration 1 === [cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2019-01-01 17:13:53,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:13:53,079 INFO L82 PathProgramCache]: Analyzing trace with hash 1757851682, now seen corresponding path program 1 times [2019-01-01 17:13:53,084 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-01 17:13:53,085 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-01-01 17:13:53,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:13:53,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:13:53,186 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 17:13:53,234 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2019-01-01 17:13:53,246 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2019-01-01 17:13:53,248 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:13:53,266 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:13:53,287 INFO L267 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-01-01 17:13:53,287 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:9, output treesize:11 [2019-01-01 17:13:53,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:13:53,366 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-01 17:13:53,371 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:13:53,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 17:13:53,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 17:13:53,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 17:13:53,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 17:13:53,390 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 3 states. [2019-01-01 17:13:53,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:13:53,517 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2019-01-01 17:13:53,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 17:13:53,520 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-01-01 17:13:53,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:13:53,531 INFO L225 Difference]: With dead ends: 36 [2019-01-01 17:13:53,531 INFO L226 Difference]: Without dead ends: 33 [2019-01-01 17:13:53,534 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 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-01-01 17:13:53,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-01-01 17:13:53,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-01-01 17:13:53,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-01-01 17:13:53,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2019-01-01 17:13:53,577 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 10 [2019-01-01 17:13:53,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:13:53,578 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2019-01-01 17:13:53,578 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 17:13:53,578 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2019-01-01 17:13:53,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-01 17:13:53,578 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:13:53,579 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:13:53,579 INFO L423 AbstractCegarLoop]: === Iteration 2 === [cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2019-01-01 17:13:53,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:13:53,579 INFO L82 PathProgramCache]: Analyzing trace with hash 1757851683, now seen corresponding path program 1 times [2019-01-01 17:13:53,581 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-01 17:13:53,581 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-01 17:13:53,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:13:53,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:13:53,661 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 17:13:53,715 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 5 treesize of output 1 [2019-01-01 17:13:53,716 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 17:13:53,755 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2019-01-01 17:13:53,771 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 12 treesize of output 15 [2019-01-01 17:13:53,772 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-01 17:13:53,785 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:13:53,843 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:13:53,843 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:24, output treesize:12 [2019-01-01 17:13:53,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:13:53,874 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-01 17:13:53,878 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:13:53,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 17:13:53,881 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-01 17:13:53,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 17:13:53,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-01 17:13:53,886 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand 4 states. [2019-01-01 17:13:53,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:13:53,971 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2019-01-01 17:13:53,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 17:13:53,973 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-01-01 17:13:53,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:13:53,977 INFO L225 Difference]: With dead ends: 43 [2019-01-01 17:13:53,977 INFO L226 Difference]: Without dead ends: 43 [2019-01-01 17:13:53,978 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-01 17:13:53,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-01-01 17:13:53,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 36. [2019-01-01 17:13:53,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-01 17:13:53,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2019-01-01 17:13:53,989 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 10 [2019-01-01 17:13:53,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:13:53,989 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2019-01-01 17:13:53,990 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-01 17:13:53,991 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2019-01-01 17:13:53,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-01 17:13:53,991 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:13:53,991 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:13:53,992 INFO L423 AbstractCegarLoop]: === Iteration 3 === [cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2019-01-01 17:13:53,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:13:53,992 INFO L82 PathProgramCache]: Analyzing trace with hash 1757911265, now seen corresponding path program 1 times [2019-01-01 17:13:53,992 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-01 17:13:53,993 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-01 17:13:54,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:13:54,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:13:54,068 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 17:13:54,148 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2019-01-01 17:13:54,168 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 12 treesize of output 15 [2019-01-01 17:13:54,170 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:13:54,217 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:13:54,310 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 5 treesize of output 1 [2019-01-01 17:13:54,311 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-01 17:13:54,333 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:13:54,334 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:25, output treesize:13 [2019-01-01 17:13:54,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:13:54,357 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-01 17:13:54,360 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:13:54,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 17:13:54,360 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-01 17:13:54,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 17:13:54,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-01 17:13:54,361 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand 4 states. [2019-01-01 17:13:54,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:13:54,452 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2019-01-01 17:13:54,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 17:13:54,453 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-01-01 17:13:54,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:13:54,454 INFO L225 Difference]: With dead ends: 35 [2019-01-01 17:13:54,454 INFO L226 Difference]: Without dead ends: 35 [2019-01-01 17:13:54,454 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-01 17:13:54,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-01-01 17:13:54,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2019-01-01 17:13:54,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-01 17:13:54,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2019-01-01 17:13:54,459 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 10 [2019-01-01 17:13:54,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:13:54,460 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2019-01-01 17:13:54,460 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-01 17:13:54,460 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2019-01-01 17:13:54,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-01 17:13:54,460 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:13:54,461 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:13:54,462 INFO L423 AbstractCegarLoop]: === Iteration 4 === [cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2019-01-01 17:13:54,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:13:54,462 INFO L82 PathProgramCache]: Analyzing trace with hash -1341172715, now seen corresponding path program 1 times [2019-01-01 17:13:54,462 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-01 17:13:54,463 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-01 17:13:54,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:13:54,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:13:54,527 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 17:13:54,533 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2019-01-01 17:13:54,547 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2019-01-01 17:13:54,548 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:13:54,557 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:13:54,568 INFO L267 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-01-01 17:13:54,568 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:9, output treesize:11 [2019-01-01 17:13:54,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:13:54,592 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-01 17:13:54,597 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:13:54,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 17:13:54,597 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 17:13:54,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 17:13:54,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 17:13:54,598 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand 3 states. [2019-01-01 17:13:54,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:13:54,662 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2019-01-01 17:13:54,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 17:13:54,664 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-01-01 17:13:54,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:13:54,665 INFO L225 Difference]: With dead ends: 31 [2019-01-01 17:13:54,665 INFO L226 Difference]: Without dead ends: 31 [2019-01-01 17:13:54,666 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 17:13:54,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-01-01 17:13:54,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-01-01 17:13:54,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-01 17:13:54,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2019-01-01 17:13:54,671 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 11 [2019-01-01 17:13:54,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:13:54,672 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2019-01-01 17:13:54,672 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 17:13:54,673 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2019-01-01 17:13:54,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-01 17:13:54,674 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:13:54,674 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:13:54,674 INFO L423 AbstractCegarLoop]: === Iteration 5 === [cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2019-01-01 17:13:54,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:13:54,675 INFO L82 PathProgramCache]: Analyzing trace with hash -1341172714, now seen corresponding path program 1 times [2019-01-01 17:13:54,676 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-01 17:13:54,676 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-01 17:13:54,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:13:54,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:13:54,778 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 17:13:54,847 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2019-01-01 17:13:55,004 INFO L478 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 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 15 [2019-01-01 17:13:55,006 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-01 17:13:55,114 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 17:13:55,155 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:13:55,155 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:16, output treesize:12 [2019-01-01 17:13:55,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:13:55,171 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-01 17:13:55,175 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:13:55,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 17:13:55,175 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-01 17:13:55,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 17:13:55,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-01 17:13:55,176 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand 4 states. [2019-01-01 17:13:55,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:13:55,246 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2019-01-01 17:13:55,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 17:13:55,247 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-01-01 17:13:55,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:13:55,249 INFO L225 Difference]: With dead ends: 38 [2019-01-01 17:13:55,249 INFO L226 Difference]: Without dead ends: 38 [2019-01-01 17:13:55,249 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-01 17:13:55,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-01-01 17:13:55,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 34. [2019-01-01 17:13:55,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-01-01 17:13:55,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2019-01-01 17:13:55,255 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 11 [2019-01-01 17:13:55,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:13:55,255 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2019-01-01 17:13:55,255 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-01 17:13:55,256 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2019-01-01 17:13:55,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-01 17:13:55,257 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:13:55,257 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:13:55,257 INFO L423 AbstractCegarLoop]: === Iteration 6 === [cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2019-01-01 17:13:55,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:13:55,258 INFO L82 PathProgramCache]: Analyzing trace with hash -1341113132, now seen corresponding path program 1 times [2019-01-01 17:13:55,258 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-01 17:13:55,258 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-01 17:13:55,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:13:55,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:13:55,327 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 17:13:55,363 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2019-01-01 17:13:55,404 INFO L478 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 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 15 [2019-01-01 17:13:55,406 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-01 17:13:55,453 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 17:13:55,492 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:13:55,492 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:13 [2019-01-01 17:13:55,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:13:55,517 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-01 17:13:55,521 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:13:55,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 17:13:55,521 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-01 17:13:55,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 17:13:55,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-01 17:13:55,522 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand 4 states. [2019-01-01 17:13:55,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:13:55,588 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2019-01-01 17:13:55,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 17:13:55,591 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-01-01 17:13:55,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:13:55,592 INFO L225 Difference]: With dead ends: 33 [2019-01-01 17:13:55,592 INFO L226 Difference]: Without dead ends: 33 [2019-01-01 17:13:55,593 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-01 17:13:55,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-01-01 17:13:55,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 30. [2019-01-01 17:13:55,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-01 17:13:55,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2019-01-01 17:13:55,596 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 11 [2019-01-01 17:13:55,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:13:55,596 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2019-01-01 17:13:55,597 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-01 17:13:55,597 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2019-01-01 17:13:55,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-01 17:13:55,598 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:13:55,598 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:13:55,599 INFO L423 AbstractCegarLoop]: === Iteration 7 === [cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2019-01-01 17:13:55,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:13:55,599 INFO L82 PathProgramCache]: Analyzing trace with hash -1317020149, now seen corresponding path program 1 times [2019-01-01 17:13:55,599 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-01 17:13:55,599 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-01 17:13:55,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:13:55,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:13:55,702 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 17:13:55,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:13:55,746 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-01 17:13:55,748 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:13:55,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 17:13:55,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 17:13:55,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 17:13:55,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-01 17:13:55,750 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand 6 states. [2019-01-01 17:13:56,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:13:56,114 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2019-01-01 17:13:56,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 17:13:56,115 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2019-01-01 17:13:56,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:13:56,116 INFO L225 Difference]: With dead ends: 29 [2019-01-01 17:13:56,117 INFO L226 Difference]: Without dead ends: 29 [2019-01-01 17:13:56,117 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-01 17:13:56,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-01-01 17:13:56,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-01-01 17:13:56,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-01 17:13:56,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2019-01-01 17:13:56,124 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 15 [2019-01-01 17:13:56,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:13:56,125 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2019-01-01 17:13:56,125 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 17:13:56,125 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2019-01-01 17:13:56,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-01 17:13:56,126 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:13:56,126 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:13:56,127 INFO L423 AbstractCegarLoop]: === Iteration 8 === [cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2019-01-01 17:13:56,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:13:56,127 INFO L82 PathProgramCache]: Analyzing trace with hash -1317020148, now seen corresponding path program 1 times [2019-01-01 17:13:56,127 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-01 17:13:56,128 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-01 17:13:56,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:13:56,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:13:56,232 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 17:13:56,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:13:56,368 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-01 17:13:56,370 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:13:56,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-01 17:13:56,371 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-01 17:13:56,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-01 17:13:56,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-01-01 17:13:56,372 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand 8 states. [2019-01-01 17:13:56,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:13:56,706 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2019-01-01 17:13:56,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 17:13:56,707 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2019-01-01 17:13:56,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:13:56,709 INFO L225 Difference]: With dead ends: 54 [2019-01-01 17:13:56,709 INFO L226 Difference]: Without dead ends: 54 [2019-01-01 17:13:56,710 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-01-01 17:13:56,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-01-01 17:13:56,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 47. [2019-01-01 17:13:56,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-01-01 17:13:56,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 56 transitions. [2019-01-01 17:13:56,717 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 56 transitions. Word has length 15 [2019-01-01 17:13:56,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:13:56,717 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 56 transitions. [2019-01-01 17:13:56,717 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-01 17:13:56,717 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 56 transitions. [2019-01-01 17:13:56,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-01 17:13:56,718 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:13:56,718 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:13:56,718 INFO L423 AbstractCegarLoop]: === Iteration 9 === [cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2019-01-01 17:13:56,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:13:56,719 INFO L82 PathProgramCache]: Analyzing trace with hash -636961778, now seen corresponding path program 1 times [2019-01-01 17:13:56,720 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-01 17:13:56,720 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-01 17:13:56,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:13:56,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:13:56,805 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 17:13:57,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:13:57,065 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-01 17:13:57,067 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:13:57,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-01 17:13:57,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-01 17:13:57,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-01 17:13:57,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-01-01 17:13:57,069 INFO L87 Difference]: Start difference. First operand 47 states and 56 transitions. Second operand 8 states. [2019-01-01 17:13:57,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:13:57,482 INFO L93 Difference]: Finished difference Result 51 states and 60 transitions. [2019-01-01 17:13:57,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 17:13:57,483 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2019-01-01 17:13:57,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:13:57,486 INFO L225 Difference]: With dead ends: 51 [2019-01-01 17:13:57,486 INFO L226 Difference]: Without dead ends: 51 [2019-01-01 17:13:57,486 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-01-01 17:13:57,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-01-01 17:13:57,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 31. [2019-01-01 17:13:57,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-01 17:13:57,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2019-01-01 17:13:57,491 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 15 [2019-01-01 17:13:57,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:13:57,491 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2019-01-01 17:13:57,491 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-01 17:13:57,492 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2019-01-01 17:13:57,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-01 17:13:57,493 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:13:57,493 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:13:57,493 INFO L423 AbstractCegarLoop]: === Iteration 10 === [cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2019-01-01 17:13:57,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:13:57,494 INFO L82 PathProgramCache]: Analyzing trace with hash -820999840, now seen corresponding path program 1 times [2019-01-01 17:13:57,494 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-01 17:13:57,494 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-01 17:13:57,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:13:57,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:13:57,589 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 17:13:57,597 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2019-01-01 17:13:57,602 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2019-01-01 17:13:57,604 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:13:57,626 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:13:57,634 INFO L267 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-01-01 17:13:57,634 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:9, output treesize:11 [2019-01-01 17:13:57,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:13:57,702 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-01 17:13:57,707 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:13:57,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 17:13:57,707 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-01 17:13:57,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 17:13:57,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-01 17:13:57,708 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand 7 states. [2019-01-01 17:13:57,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:13:57,933 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2019-01-01 17:13:57,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 17:13:57,934 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2019-01-01 17:13:57,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:13:57,936 INFO L225 Difference]: With dead ends: 31 [2019-01-01 17:13:57,936 INFO L226 Difference]: Without dead ends: 31 [2019-01-01 17:13:57,937 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-01-01 17:13:57,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-01-01 17:13:57,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2019-01-01 17:13:57,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-01 17:13:57,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2019-01-01 17:13:57,941 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 18 [2019-01-01 17:13:57,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:13:57,941 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2019-01-01 17:13:57,941 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-01 17:13:57,942 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2019-01-01 17:13:57,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-01 17:13:57,942 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:13:57,942 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:13:57,943 INFO L423 AbstractCegarLoop]: === Iteration 11 === [cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2019-01-01 17:13:57,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:13:57,943 INFO L82 PathProgramCache]: Analyzing trace with hash -820999839, now seen corresponding path program 1 times [2019-01-01 17:13:57,943 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-01 17:13:57,943 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-01 17:13:57,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:13:58,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:13:58,060 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 17:13:58,077 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2019-01-01 17:13:58,102 INFO L478 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 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 15 [2019-01-01 17:13:58,102 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-01 17:13:58,123 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 17:13:58,153 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:13:58,154 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2019-01-01 17:13:58,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:13:58,228 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-01 17:13:58,230 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:13:58,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-01 17:13:58,230 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-01 17:13:58,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-01 17:13:58,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-01-01 17:13:58,231 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand 8 states. [2019-01-01 17:13:58,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:13:58,551 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2019-01-01 17:13:58,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-01 17:13:58,552 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2019-01-01 17:13:58,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:13:58,552 INFO L225 Difference]: With dead ends: 56 [2019-01-01 17:13:58,552 INFO L226 Difference]: Without dead ends: 56 [2019-01-01 17:13:58,553 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-01-01 17:13:58,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-01-01 17:13:58,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 49. [2019-01-01 17:13:58,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-01-01 17:13:58,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2019-01-01 17:13:58,557 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 56 transitions. Word has length 18 [2019-01-01 17:13:58,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:13:58,558 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 56 transitions. [2019-01-01 17:13:58,559 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-01 17:13:58,559 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2019-01-01 17:13:58,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-01 17:13:58,559 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:13:58,559 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:13:58,560 INFO L423 AbstractCegarLoop]: === Iteration 12 === [cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2019-01-01 17:13:58,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:13:58,560 INFO L82 PathProgramCache]: Analyzing trace with hash -119935261, now seen corresponding path program 1 times [2019-01-01 17:13:58,560 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-01 17:13:58,560 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-01 17:13:58,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:13:58,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:13:58,658 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 17:13:58,691 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2019-01-01 17:13:58,721 INFO L478 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 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 15 [2019-01-01 17:13:58,723 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-01 17:13:58,751 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 17:13:58,787 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:13:58,788 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:17, output treesize:10 [2019-01-01 17:13:58,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:13:58,908 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-01 17:13:58,910 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:13:58,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-01 17:13:58,910 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-01 17:13:58,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-01 17:13:58,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-01-01 17:13:58,911 INFO L87 Difference]: Start difference. First operand 49 states and 56 transitions. Second operand 8 states. [2019-01-01 17:13:59,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:13:59,452 INFO L93 Difference]: Finished difference Result 55 states and 64 transitions. [2019-01-01 17:13:59,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-01 17:13:59,454 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2019-01-01 17:13:59,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:13:59,455 INFO L225 Difference]: With dead ends: 55 [2019-01-01 17:13:59,455 INFO L226 Difference]: Without dead ends: 55 [2019-01-01 17:13:59,456 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-01-01 17:13:59,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-01 17:13:59,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 32. [2019-01-01 17:13:59,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-01 17:13:59,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2019-01-01 17:13:59,461 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 18 [2019-01-01 17:13:59,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:13:59,461 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2019-01-01 17:13:59,461 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-01 17:13:59,461 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2019-01-01 17:13:59,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-01 17:13:59,462 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:13:59,462 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:13:59,463 INFO L423 AbstractCegarLoop]: === Iteration 13 === [cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2019-01-01 17:13:59,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:13:59,465 INFO L82 PathProgramCache]: Analyzing trace with hash -2018091976, now seen corresponding path program 1 times [2019-01-01 17:13:59,466 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-01 17:13:59,466 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-01 17:13:59,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:13:59,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:13:59,641 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 17:13:59,692 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 5 treesize of output 1 [2019-01-01 17:13:59,693 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 17:13:59,702 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:13:59,702 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-01-01 17:13:59,731 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2019-01-01 17:13:59,734 INFO L478 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 9 treesize of output 8 [2019-01-01 17:13:59,735 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:13:59,740 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:13:59,749 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:13:59,749 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2019-01-01 17:13:59,803 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 25 [2019-01-01 17:13:59,808 INFO L478 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 12 treesize of output 11 [2019-01-01 17:13:59,809 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:13:59,822 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:13:59,842 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-01 17:13:59,843 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:31, output treesize:27 [2019-01-01 17:14:00,017 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2019-01-01 17:14:00,022 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2019-01-01 17:14:00,022 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:14:00,033 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2019-01-01 17:14:00,033 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-01 17:14:00,036 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:14:00,043 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:14:00,043 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:32, output treesize:5 [2019-01-01 17:14:00,151 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:14:00,151 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-01 17:14:00,153 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:14:00,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-01-01 17:14:00,153 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-01 17:14:00,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-01 17:14:00,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-01-01 17:14:00,154 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand 12 states. [2019-01-01 17:14:00,521 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 29 [2019-01-01 17:14:01,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:14:01,125 INFO L93 Difference]: Finished difference Result 56 states and 60 transitions. [2019-01-01 17:14:01,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-01 17:14:01,126 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2019-01-01 17:14:01,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:14:01,126 INFO L225 Difference]: With dead ends: 56 [2019-01-01 17:14:01,127 INFO L226 Difference]: Without dead ends: 56 [2019-01-01 17:14:01,127 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2019-01-01 17:14:01,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-01-01 17:14:01,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 50. [2019-01-01 17:14:01,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-01-01 17:14:01,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2019-01-01 17:14:01,134 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 23 [2019-01-01 17:14:01,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:14:01,135 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2019-01-01 17:14:01,135 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-01 17:14:01,135 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2019-01-01 17:14:01,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-01 17:14:01,136 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:14:01,136 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:14:01,136 INFO L423 AbstractCegarLoop]: === Iteration 14 === [cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2019-01-01 17:14:01,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:14:01,136 INFO L82 PathProgramCache]: Analyzing trace with hash -2018089798, now seen corresponding path program 1 times [2019-01-01 17:14:01,139 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-01 17:14:01,139 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-01 17:14:01,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:14:01,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:14:01,273 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 17:14:01,381 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2019-01-01 17:14:01,385 INFO L478 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 9 treesize of output 8 [2019-01-01 17:14:01,386 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:14:01,392 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:14:01,399 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:14:01,399 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2019-01-01 17:14:01,516 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2019-01-01 17:14:01,518 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2019-01-01 17:14:01,518 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:14:01,519 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:14:01,520 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:14:01,521 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2019-01-01 17:14:01,560 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:14:01,560 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-01 17:14:01,563 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:14:01,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-01-01 17:14:01,564 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-01 17:14:01,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-01 17:14:01,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-01-01 17:14:01,565 INFO L87 Difference]: Start difference. First operand 50 states and 56 transitions. Second operand 11 states. [2019-01-01 17:14:02,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:14:02,397 INFO L93 Difference]: Finished difference Result 94 states and 100 transitions. [2019-01-01 17:14:02,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-01 17:14:02,399 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 23 [2019-01-01 17:14:02,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:14:02,400 INFO L225 Difference]: With dead ends: 94 [2019-01-01 17:14:02,401 INFO L226 Difference]: Without dead ends: 93 [2019-01-01 17:14:02,401 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2019-01-01 17:14:02,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-01-01 17:14:02,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 81. [2019-01-01 17:14:02,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-01-01 17:14:02,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 89 transitions. [2019-01-01 17:14:02,409 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 89 transitions. Word has length 23 [2019-01-01 17:14:02,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:14:02,409 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 89 transitions. [2019-01-01 17:14:02,409 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-01 17:14:02,409 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 89 transitions. [2019-01-01 17:14:02,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-01 17:14:02,411 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:14:02,412 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:14:02,412 INFO L423 AbstractCegarLoop]: === Iteration 15 === [cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2019-01-01 17:14:02,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:14:02,412 INFO L82 PathProgramCache]: Analyzing trace with hash 1255809144, now seen corresponding path program 1 times [2019-01-01 17:14:02,412 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-01 17:14:02,412 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-01 17:14:02,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:14:02,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:14:02,547 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 17:14:02,560 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2019-01-01 17:14:02,588 INFO L478 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 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 15 [2019-01-01 17:14:02,589 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-01 17:14:02,619 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 17:14:02,650 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:14:02,651 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:13 [2019-01-01 17:14:02,673 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 14 [2019-01-01 17:14:02,678 INFO L478 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 14 treesize of output 13 [2019-01-01 17:14:02,678 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:14:02,700 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:14:02,727 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:14:02,727 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:23 [2019-01-01 17:14:02,940 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2019-01-01 17:14:02,970 INFO L478 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 18 [2019-01-01 17:14:02,972 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-01 17:14:02,984 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-01 17:14:03,002 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-01 17:14:03,003 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:38 [2019-01-01 17:14:03,280 WARN L181 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 21 [2019-01-01 17:14:03,531 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:14:03,531 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-01 17:14:04,721 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 38 [2019-01-01 17:14:04,848 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 22 [2019-01-01 17:14:04,855 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2019-01-01 17:14:04,856 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:14:04,893 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:14:04,900 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 38 [2019-01-01 17:14:05,009 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 24 [2019-01-01 17:14:05,020 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2019-01-01 17:14:05,026 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 17:14:05,068 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:14:05,073 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 36 [2019-01-01 17:14:05,146 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2019-01-01 17:14:05,147 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-01 17:14:05,168 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:14:05,278 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-01-01 17:14:05,279 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 1 variables, input treesize:119, output treesize:77 [2019-01-01 17:14:05,630 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-01-01 17:14:05,659 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:14:05,661 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 17:14:05,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 22 [2019-01-01 17:14:05,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-01-01 17:14:05,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-01-01 17:14:05,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=439, Unknown=0, NotChecked=0, Total=506 [2019-01-01 17:14:05,663 INFO L87 Difference]: Start difference. First operand 81 states and 89 transitions. Second operand 23 states. [2019-01-01 17:14:06,014 WARN L181 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 25 [2019-01-01 17:14:06,914 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2019-01-01 17:14:07,233 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2019-01-01 17:14:07,592 WARN L181 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-01-01 17:14:08,118 WARN L181 SmtUtils]: Spent 421.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-01-01 17:14:08,561 WARN L181 SmtUtils]: Spent 288.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2019-01-01 17:14:14,157 WARN L181 SmtUtils]: Spent 273.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2019-01-01 17:14:14,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:14:14,217 INFO L93 Difference]: Finished difference Result 105 states and 118 transitions. [2019-01-01 17:14:14,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-01-01 17:14:14,219 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2019-01-01 17:14:14,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:14:14,221 INFO L225 Difference]: With dead ends: 105 [2019-01-01 17:14:14,221 INFO L226 Difference]: Without dead ends: 105 [2019-01-01 17:14:14,222 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=204, Invalid=1056, Unknown=0, NotChecked=0, Total=1260 [2019-01-01 17:14:14,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-01-01 17:14:14,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 91. [2019-01-01 17:14:14,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-01-01 17:14:14,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 102 transitions. [2019-01-01 17:14:14,234 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 102 transitions. Word has length 23 [2019-01-01 17:14:14,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:14:14,235 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 102 transitions. [2019-01-01 17:14:14,235 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-01-01 17:14:14,235 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 102 transitions. [2019-01-01 17:14:14,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-01 17:14:14,236 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:14:14,236 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:14:14,238 INFO L423 AbstractCegarLoop]: === Iteration 16 === [cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2019-01-01 17:14:14,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:14:14,239 INFO L82 PathProgramCache]: Analyzing trace with hash 688527418, now seen corresponding path program 1 times [2019-01-01 17:14:14,239 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-01 17:14:14,239 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-01 17:14:14,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:14:14,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:14:14,373 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 17:14:14,431 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 5 treesize of output 1 [2019-01-01 17:14:14,432 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 17:14:14,455 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:14:14,455 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2019-01-01 17:14:14,495 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2019-01-01 17:14:14,501 INFO L478 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 12 treesize of output 11 [2019-01-01 17:14:14,502 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:14:14,506 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:14:14,546 INFO L267 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-01-01 17:14:14,547 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:36 [2019-01-01 17:14:14,610 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 25 [2019-01-01 17:14:14,616 INFO L478 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 9 treesize of output 8 [2019-01-01 17:14:14,616 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:14:14,634 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:14:14,674 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-01 17:14:14,674 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:38 [2019-01-01 17:14:14,919 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 27 [2019-01-01 17:14:14,936 INFO L478 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 18 [2019-01-01 17:14:14,938 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-01 17:14:14,956 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-01 17:14:14,987 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-01-01 17:14:14,988 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:48 [2019-01-01 17:14:15,336 WARN L181 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 31 [2019-01-01 17:14:15,814 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:14:15,814 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-01 17:14:18,683 WARN L181 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2019-01-01 17:14:18,699 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 78 [2019-01-01 17:14:18,701 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 17:14:19,119 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 76 [2019-01-01 17:14:19,121 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 17:14:19,657 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 76 [2019-01-01 17:14:19,659 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 17:14:20,166 INFO L478 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 0 case distinctions, treesize of input 76 treesize of output 65 [2019-01-01 17:14:20,353 WARN L181 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 41 [2019-01-01 17:14:20,361 INFO L478 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 13 treesize of output 12 [2019-01-01 17:14:20,361 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-01 17:14:20,448 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-01-01 17:14:20,458 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 17:14:20,459 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 17:14:20,461 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2019-01-01 17:14:20,462 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 17:14:20,480 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 17:14:20,575 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-01-01 17:14:20,956 INFO L478 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 0 case distinctions, treesize of input 72 treesize of output 61 [2019-01-01 17:14:21,165 WARN L181 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 40 [2019-01-01 17:14:21,179 INFO L478 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 13 treesize of output 12 [2019-01-01 17:14:21,179 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-01 17:14:21,388 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-01-01 17:14:21,407 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 17:14:21,408 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 17:14:21,410 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2019-01-01 17:14:21,411 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 17:14:21,514 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 17:14:21,588 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-01-01 17:14:22,119 INFO L478 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 0 case distinctions, treesize of input 76 treesize of output 65 [2019-01-01 17:14:22,326 WARN L181 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2019-01-01 17:14:22,342 INFO L478 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 13 treesize of output 12 [2019-01-01 17:14:22,342 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-01-01 17:14:22,444 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-01-01 17:14:24,453 WARN L670 Elim1Store]: solver failed to check if following equality is implied: (= main_~nondetString1~0.offset (bvadd main_~nondetString1~0.offset main_~length1~0 (_ bv4294967295 32))) [2019-01-01 17:14:24,456 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 17:14:24,457 INFO L303 Elim1Store]: Index analysis took 2012 ms [2019-01-01 17:14:24,458 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2019-01-01 17:14:24,459 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 17:14:24,482 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 17:14:24,563 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-01-01 17:14:25,099 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-1 vars, 3 dim-2 vars, End of recursive call: 6 dim-0 vars, and 6 xjuncts. [2019-01-01 17:14:25,099 INFO L202 ElimStorePlain]: Needed 16 recursive calls to eliminate 9 variables, input treesize:245, output treesize:206 [2019-01-01 17:14:26,123 WARN L181 SmtUtils]: Spent 658.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 45 [2019-01-01 17:14:26,378 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:14:26,380 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 17:14:26,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 26 [2019-01-01 17:14:26,381 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-01-01 17:14:26,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-01-01 17:14:26,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=614, Unknown=0, NotChecked=0, Total=702 [2019-01-01 17:14:26,382 INFO L87 Difference]: Start difference. First operand 91 states and 102 transitions. Second operand 27 states. [2019-01-01 17:14:27,022 WARN L181 SmtUtils]: Spent 399.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2019-01-01 17:14:28,566 WARN L181 SmtUtils]: Spent 566.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2019-01-01 17:14:29,817 WARN L181 SmtUtils]: Spent 527.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-01-01 17:14:30,627 WARN L181 SmtUtils]: Spent 234.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2019-01-01 17:14:31,517 WARN L181 SmtUtils]: Spent 258.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-01-01 17:14:32,218 WARN L181 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 63 [2019-01-01 17:14:33,506 WARN L181 SmtUtils]: Spent 844.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 88 [2019-01-01 17:14:34,383 WARN L181 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2019-01-01 17:14:35,749 WARN L181 SmtUtils]: Spent 381.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2019-01-01 17:14:36,349 WARN L181 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 59 [2019-01-01 17:14:37,062 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2019-01-01 17:14:38,061 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2019-01-01 17:14:39,410 WARN L181 SmtUtils]: Spent 506.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2019-01-01 17:14:40,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:14:40,440 INFO L93 Difference]: Finished difference Result 124 states and 138 transitions. [2019-01-01 17:14:40,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-01-01 17:14:40,442 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 23 [2019-01-01 17:14:40,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:14:40,444 INFO L225 Difference]: With dead ends: 124 [2019-01-01 17:14:40,444 INFO L226 Difference]: Without dead ends: 124 [2019-01-01 17:14:40,445 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 17 SyntacticMatches, 3 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 392 ImplicationChecksByTransitivity, 15.2s TimeCoverageRelationStatistics Valid=279, Invalid=1977, Unknown=0, NotChecked=0, Total=2256 [2019-01-01 17:14:40,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-01-01 17:14:40,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 114. [2019-01-01 17:14:40,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-01-01 17:14:40,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 131 transitions. [2019-01-01 17:14:40,454 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 131 transitions. Word has length 23 [2019-01-01 17:14:40,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:14:40,454 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 131 transitions. [2019-01-01 17:14:40,454 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-01-01 17:14:40,454 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 131 transitions. [2019-01-01 17:14:40,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-01 17:14:40,467 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:14:40,467 INFO L402 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-01-01 17:14:40,467 INFO L423 AbstractCegarLoop]: === Iteration 17 === [cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2019-01-01 17:14:40,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:14:40,467 INFO L82 PathProgramCache]: Analyzing trace with hash 1863036971, now seen corresponding path program 1 times [2019-01-01 17:14:40,470 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-01 17:14:40,470 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-01 17:14:40,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:14:40,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:14:40,628 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 17:14:40,633 INFO L478 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-01-01 17:14:40,634 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 17:14:40,637 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:14:40,637 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-01-01 17:14:40,701 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 17:14:40,712 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 34 [2019-01-01 17:14:40,742 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 17:14:40,744 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 17:14:40,745 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 34 [2019-01-01 17:14:40,745 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:14:40,782 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 17:14:40,784 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 24 [2019-01-01 17:14:40,785 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-01 17:14:40,874 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 17:14:40,901 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-01-01 17:14:40,901 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:32, output treesize:38 [2019-01-01 17:14:47,097 WARN L181 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 23 [2019-01-01 17:14:47,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:14:47,101 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-01 17:14:47,104 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:14:47,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 17:14:47,104 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-01 17:14:47,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 17:14:47,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=25, Unknown=2, NotChecked=0, Total=42 [2019-01-01 17:14:47,105 INFO L87 Difference]: Start difference. First operand 114 states and 131 transitions. Second operand 7 states. [2019-01-01 17:15:09,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:15:09,479 INFO L93 Difference]: Finished difference Result 113 states and 130 transitions. [2019-01-01 17:15:09,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 17:15:09,481 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2019-01-01 17:15:09,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:15:09,483 INFO L225 Difference]: With dead ends: 113 [2019-01-01 17:15:09,483 INFO L226 Difference]: Without dead ends: 91 [2019-01-01 17:15:09,483 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=25, Invalid=45, Unknown=2, NotChecked=0, Total=72 [2019-01-01 17:15:09,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-01-01 17:15:09,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-01-01 17:15:09,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-01-01 17:15:09,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 100 transitions. [2019-01-01 17:15:09,491 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 100 transitions. Word has length 24 [2019-01-01 17:15:09,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:15:09,491 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 100 transitions. [2019-01-01 17:15:09,491 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-01 17:15:09,491 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 100 transitions. [2019-01-01 17:15:09,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-01-01 17:15:09,494 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:15:09,494 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:15:09,494 INFO L423 AbstractCegarLoop]: === Iteration 18 === [cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2019-01-01 17:15:09,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:15:09,494 INFO L82 PathProgramCache]: Analyzing trace with hash -728587261, now seen corresponding path program 2 times [2019-01-01 17:15:09,494 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-01 17:15:09,495 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-01 17:15:09,513 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2019-01-01 17:15:09,644 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-01 17:15:09,644 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 17:15:09,648 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 17:15:09,715 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2019-01-01 17:15:09,724 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 12 treesize of output 15 [2019-01-01 17:15:09,724 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:15:09,734 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:15:09,770 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 5 treesize of output 1 [2019-01-01 17:15:09,771 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-01 17:15:09,796 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:15:09,797 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:31, output treesize:28 [2019-01-01 17:15:09,839 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 14 [2019-01-01 17:15:09,845 INFO L478 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 14 treesize of output 13 [2019-01-01 17:15:09,846 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:15:09,850 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:15:09,875 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:15:09,875 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:44, output treesize:40 [2019-01-01 17:15:09,937 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 32 [2019-01-01 17:15:09,944 INFO L478 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 14 treesize of output 13 [2019-01-01 17:15:09,944 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:15:09,958 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:15:10,003 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:15:10,003 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:74, output treesize:50 [2019-01-01 17:15:10,756 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2019-01-01 17:15:10,761 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 1 [2019-01-01 17:15:10,761 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:15:10,792 INFO L478 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 18 [2019-01-01 17:15:10,793 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-01 17:15:10,810 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-01 17:15:10,841 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-01-01 17:15:10,841 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:56, output treesize:46 [2019-01-01 17:15:11,209 WARN L181 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 29 [2019-01-01 17:15:11,539 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:15:11,539 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-01 17:15:14,328 INFO L478 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 0 case distinctions, treesize of input 60 treesize of output 61 [2019-01-01 17:15:14,351 INFO L478 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 13 treesize of output 12 [2019-01-01 17:15:14,352 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:15:14,694 INFO L478 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 35 [2019-01-01 17:15:14,925 WARN L181 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 37 [2019-01-01 17:15:14,939 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 18 [2019-01-01 17:15:14,940 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 17:15:15,004 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-01-01 17:15:15,006 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-01 17:15:17,054 WARN L670 Elim1Store]: solver failed to check if following equality is implied: (= (bvadd main_~nondetString1~0.offset main_~length1~0 (_ bv4294967295 32)) (bvadd main_~nondetString2~0.offset (_ bv1 32))) [2019-01-01 17:15:17,058 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 17:15:17,060 INFO L303 Elim1Store]: Index analysis took 2016 ms [2019-01-01 17:15:17,061 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2019-01-01 17:15:17,064 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-01 17:15:17,086 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 17:15:17,151 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-01 17:15:17,168 INFO L478 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 0 case distinctions, treesize of input 62 treesize of output 63 [2019-01-01 17:15:17,183 INFO L478 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 13 treesize of output 12 [2019-01-01 17:15:17,184 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-01 17:15:17,293 INFO L478 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 35 [2019-01-01 17:15:17,452 WARN L181 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 37 [2019-01-01 17:15:17,462 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 18 [2019-01-01 17:15:17,463 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-01 17:15:17,543 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2019-01-01 17:15:17,545 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-01 17:15:19,637 WARN L670 Elim1Store]: solver failed to check if following equality is implied: (= (bvadd main_~nondetString1~0.offset main_~length1~0 (_ bv4294967295 32)) (bvadd main_~nondetString2~0.offset (_ bv1 32))) [2019-01-01 17:15:19,641 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 17:15:19,644 INFO L303 Elim1Store]: Index analysis took 2025 ms [2019-01-01 17:15:19,644 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 23 [2019-01-01 17:15:19,654 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-01 17:15:19,696 INFO L267 ElimStorePlain]: Start of recursive call 10: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 17:15:19,783 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-01 17:15:19,809 INFO L478 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 0 case distinctions, treesize of input 62 treesize of output 63 [2019-01-01 17:15:19,827 INFO L478 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 13 treesize of output 12 [2019-01-01 17:15:19,828 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-01-01 17:15:19,973 INFO L478 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 35 [2019-01-01 17:15:20,094 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 37 [2019-01-01 17:15:20,110 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 18 [2019-01-01 17:15:20,111 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-01-01 17:15:20,206 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 17:15:20,206 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 17:15:20,209 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 23 [2019-01-01 17:15:20,210 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2019-01-01 17:15:20,280 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2019-01-01 17:15:20,282 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2019-01-01 17:15:20,328 INFO L267 ElimStorePlain]: Start of recursive call 16: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 17:15:20,437 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-01 17:15:20,773 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 6 xjuncts. [2019-01-01 17:15:20,774 INFO L202 ElimStorePlain]: Needed 19 recursive calls to eliminate 1 variables, input treesize:185, output treesize:242 [2019-01-01 17:15:21,560 WARN L181 SmtUtils]: Spent 365.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2019-01-01 17:15:21,577 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:15:21,580 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 17:15:21,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13] total 29 [2019-01-01 17:15:21,581 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-01-01 17:15:21,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-01-01 17:15:21,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=774, Unknown=0, NotChecked=0, Total=870 [2019-01-01 17:15:21,582 INFO L87 Difference]: Start difference. First operand 91 states and 100 transitions. Second operand 30 states. [2019-01-01 17:15:22,431 WARN L181 SmtUtils]: Spent 457.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2019-01-01 17:15:23,674 WARN L181 SmtUtils]: Spent 389.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2019-01-01 17:15:24,479 WARN L181 SmtUtils]: Spent 494.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-01-01 17:15:24,958 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2019-01-01 17:15:25,835 WARN L181 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2019-01-01 17:15:26,561 WARN L181 SmtUtils]: Spent 214.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2019-01-01 17:15:27,485 WARN L181 SmtUtils]: Spent 557.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 79 [2019-01-01 17:15:28,321 WARN L181 SmtUtils]: Spent 229.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2019-01-01 17:15:29,448 WARN L181 SmtUtils]: Spent 696.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 83 [2019-01-01 17:15:30,413 WARN L181 SmtUtils]: Spent 349.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2019-01-01 17:15:31,678 WARN L181 SmtUtils]: Spent 860.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 90 [2019-01-01 17:15:32,435 WARN L181 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 70 [2019-01-01 17:15:33,509 WARN L181 SmtUtils]: Spent 768.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2019-01-01 17:15:34,317 WARN L181 SmtUtils]: Spent 290.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2019-01-01 17:15:35,314 WARN L181 SmtUtils]: Spent 511.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2019-01-01 17:15:36,165 WARN L181 SmtUtils]: Spent 289.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2019-01-01 17:15:36,918 WARN L181 SmtUtils]: Spent 449.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 76 [2019-01-01 17:15:38,429 WARN L181 SmtUtils]: Spent 689.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 68 [2019-01-01 17:15:39,467 WARN L181 SmtUtils]: Spent 702.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 83 [2019-01-01 17:15:41,014 WARN L181 SmtUtils]: Spent 755.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 72 [2019-01-01 17:15:42,072 WARN L181 SmtUtils]: Spent 573.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 86 [2019-01-01 17:15:42,746 WARN L181 SmtUtils]: Spent 221.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2019-01-01 17:15:43,482 WARN L181 SmtUtils]: Spent 421.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 78 [2019-01-01 17:15:44,330 WARN L181 SmtUtils]: Spent 201.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-01-01 17:15:45,326 WARN L181 SmtUtils]: Spent 573.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 86 [2019-01-01 17:15:46,142 WARN L181 SmtUtils]: Spent 230.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-01-01 17:15:47,329 WARN L181 SmtUtils]: Spent 690.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 90 [2019-01-01 17:15:48,596 WARN L181 SmtUtils]: Spent 599.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 94 [2019-01-01 17:15:49,304 WARN L181 SmtUtils]: Spent 226.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2019-01-01 17:15:50,075 WARN L181 SmtUtils]: Spent 425.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 68 [2019-01-01 17:15:51,105 WARN L181 SmtUtils]: Spent 490.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 71 [2019-01-01 17:15:52,069 WARN L181 SmtUtils]: Spent 560.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 75 [2019-01-01 17:15:53,175 WARN L181 SmtUtils]: Spent 543.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 79 [2019-01-01 17:15:53,630 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2019-01-01 17:15:54,121 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2019-01-01 17:15:54,586 WARN L181 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2019-01-01 17:15:55,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:15:55,054 INFO L93 Difference]: Finished difference Result 123 states and 133 transitions. [2019-01-01 17:15:55,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-01-01 17:15:55,057 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 28 [2019-01-01 17:15:55,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:15:55,058 INFO L225 Difference]: With dead ends: 123 [2019-01-01 17:15:55,059 INFO L226 Difference]: Without dead ends: 123 [2019-01-01 17:15:55,060 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 971 ImplicationChecksByTransitivity, 34.4s TimeCoverageRelationStatistics Valid=704, Invalid=4126, Unknown=0, NotChecked=0, Total=4830 [2019-01-01 17:15:55,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-01-01 17:15:55,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 116. [2019-01-01 17:15:55,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-01-01 17:15:55,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 127 transitions. [2019-01-01 17:15:55,064 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 127 transitions. Word has length 28 [2019-01-01 17:15:55,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:15:55,064 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 127 transitions. [2019-01-01 17:15:55,064 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-01-01 17:15:55,065 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 127 transitions. [2019-01-01 17:15:55,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-01-01 17:15:55,066 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:15:55,066 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:15:55,066 INFO L423 AbstractCegarLoop]: === Iteration 19 === [cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2019-01-01 17:15:55,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:15:55,066 INFO L82 PathProgramCache]: Analyzing trace with hash -88962970, now seen corresponding path program 2 times [2019-01-01 17:15:55,067 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-01 17:15:55,067 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-01 17:15:55,089 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 17:15:55,233 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-01 17:15:55,233 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 17:15:55,237 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 17:15:55,278 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 5 treesize of output 1 [2019-01-01 17:15:55,278 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 17:15:55,308 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2019-01-01 17:15:55,325 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 12 treesize of output 15 [2019-01-01 17:15:55,325 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-01 17:15:55,338 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:15:55,361 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:15:55,361 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:25, output treesize:22 [2019-01-01 17:15:55,402 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 14 [2019-01-01 17:15:55,410 INFO L478 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 14 treesize of output 13 [2019-01-01 17:15:55,411 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:15:55,424 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:15:55,481 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:15:55,481 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:65, output treesize:46 [2019-01-01 17:15:55,567 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 32 [2019-01-01 17:15:55,589 INFO L478 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 14 treesize of output 13 [2019-01-01 17:15:55,589 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:15:55,656 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:15:55,708 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-01 17:15:55,708 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:58, output treesize:54 [2019-01-01 17:15:56,418 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2019-01-01 17:15:56,447 INFO L478 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 18 [2019-01-01 17:15:56,448 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-01 17:15:56,497 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2019-01-01 17:15:56,498 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-01 17:15:56,517 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-01 17:15:56,560 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-01 17:15:56,561 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:64, output treesize:40 [2019-01-01 17:15:56,876 WARN L181 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 21 [2019-01-01 17:15:57,287 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:15:57,288 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-01 17:15:58,956 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-01-01 17:15:59,699 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-01-01 17:16:00,101 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-01-01 17:16:00,987 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 62 [2019-01-01 17:16:01,196 WARN L181 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 33 [2019-01-01 17:16:01,208 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2019-01-01 17:16:01,209 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 17:16:01,282 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 17:16:01,501 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 52 [2019-01-01 17:16:01,647 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 30 [2019-01-01 17:16:01,653 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2019-01-01 17:16:01,654 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 17:16:01,714 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 17:16:01,958 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 62 [2019-01-01 17:16:02,137 WARN L181 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 35 [2019-01-01 17:16:02,150 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2019-01-01 17:16:02,150 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 17:16:02,236 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 17:16:02,483 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-01-01 17:16:02,483 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:191, output treesize:109 [2019-01-01 17:16:02,976 WARN L181 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2019-01-01 17:16:02,982 INFO L267 ElimStorePlain]: Start of recursive call 1: End of recursive call: and 1 xjuncts. [2019-01-01 17:16:02,983 INFO L202 ElimStorePlain]: Needed 1 recursive calls to eliminate 5 variables, input treesize:60, output treesize:1 [2019-01-01 17:16:02,993 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:16:02,995 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 17:16:02,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 25 [2019-01-01 17:16:02,996 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-01-01 17:16:02,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-01-01 17:16:02,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=568, Unknown=0, NotChecked=0, Total=650 [2019-01-01 17:16:02,997 INFO L87 Difference]: Start difference. First operand 116 states and 127 transitions. Second operand 26 states. [2019-01-01 17:16:03,820 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 33 [2019-01-01 17:16:04,447 WARN L181 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 38 [2019-01-01 17:16:05,954 WARN L181 SmtUtils]: Spent 824.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 61 [2019-01-01 17:16:07,243 WARN L181 SmtUtils]: Spent 792.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 67 [2019-01-01 17:16:09,099 WARN L181 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 52 [2019-01-01 17:16:10,383 WARN L181 SmtUtils]: Spent 751.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 53 [2019-01-01 17:16:11,053 WARN L181 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 40 [2019-01-01 17:16:11,831 WARN L181 SmtUtils]: Spent 430.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 44 [2019-01-01 17:16:12,884 WARN L181 SmtUtils]: Spent 564.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 55 [2019-01-01 17:16:13,953 WARN L181 SmtUtils]: Spent 644.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 74 [2019-01-01 17:16:15,184 WARN L181 SmtUtils]: Spent 694.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 80 [2019-01-01 17:16:15,834 WARN L181 SmtUtils]: Spent 366.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 66 [2019-01-01 17:16:17,366 WARN L181 SmtUtils]: Spent 975.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 96 [2019-01-01 17:16:19,125 WARN L181 SmtUtils]: Spent 1.28 s on a formula simplification. DAG size of input: 113 DAG size of output: 110 [2019-01-01 17:16:20,174 WARN L181 SmtUtils]: Spent 360.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2019-01-01 17:16:21,242 WARN L181 SmtUtils]: Spent 444.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2019-01-01 17:16:22,177 WARN L181 SmtUtils]: Spent 425.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2019-01-01 17:16:23,645 WARN L181 SmtUtils]: Spent 591.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 71 [2019-01-01 17:16:24,960 WARN L181 SmtUtils]: Spent 811.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 85 [2019-01-01 17:16:25,513 WARN L181 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2019-01-01 17:16:26,265 WARN L181 SmtUtils]: Spent 233.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-01-01 17:16:27,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:16:27,740 INFO L93 Difference]: Finished difference Result 204 states and 223 transitions. [2019-01-01 17:16:27,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-01-01 17:16:27,743 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 31 [2019-01-01 17:16:27,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:16:27,745 INFO L225 Difference]: With dead ends: 204 [2019-01-01 17:16:27,746 INFO L226 Difference]: Without dead ends: 204 [2019-01-01 17:16:27,748 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 33 SyntacticMatches, 4 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 469 ImplicationChecksByTransitivity, 25.1s TimeCoverageRelationStatistics Valid=372, Invalid=2178, Unknown=0, NotChecked=0, Total=2550 [2019-01-01 17:16:27,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2019-01-01 17:16:27,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 200. [2019-01-01 17:16:27,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-01-01 17:16:27,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 223 transitions. [2019-01-01 17:16:27,754 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 223 transitions. Word has length 31 [2019-01-01 17:16:27,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:16:27,755 INFO L480 AbstractCegarLoop]: Abstraction has 200 states and 223 transitions. [2019-01-01 17:16:27,755 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-01-01 17:16:27,755 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 223 transitions. [2019-01-01 17:16:27,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-01-01 17:16:27,759 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:16:27,760 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:16:27,760 INFO L423 AbstractCegarLoop]: === Iteration 20 === [cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2019-01-01 17:16:27,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:16:27,760 INFO L82 PathProgramCache]: Analyzing trace with hash -2004369190, now seen corresponding path program 1 times [2019-01-01 17:16:27,760 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-01 17:16:27,761 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 21 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-01 17:16:27,777 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 17:16:27,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:16:27,900 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 17:16:27,924 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2019-01-01 17:16:28,021 INFO L478 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 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 15 [2019-01-01 17:16:28,022 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-01 17:16:28,049 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 17:16:28,080 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:16:28,080 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:13 [2019-01-01 17:16:28,104 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 14 [2019-01-01 17:16:28,109 INFO L478 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 14 treesize of output 13 [2019-01-01 17:16:28,109 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:16:28,114 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:16:28,155 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:16:28,155 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:23 [2019-01-01 17:16:28,618 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-01-01 17:16:28,634 INFO L478 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 20 [2019-01-01 17:16:28,635 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-01 17:16:28,648 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-01 17:16:28,670 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-01 17:16:28,671 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:38 [2019-01-01 17:16:28,960 WARN L181 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 17 [2019-01-01 17:16:29,206 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:16:29,206 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-01 17:16:31,819 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 56 [2019-01-01 17:16:31,991 WARN L181 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 31 [2019-01-01 17:16:31,998 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-01 17:16:32,000 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:16:32,065 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:16:32,072 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 54 [2019-01-01 17:16:32,227 WARN L181 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 28 [2019-01-01 17:16:32,235 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-01 17:16:32,239 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 17:16:32,299 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:16:32,309 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 56 [2019-01-01 17:16:32,503 WARN L181 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 33 [2019-01-01 17:16:32,513 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-01 17:16:32,517 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-01 17:16:32,598 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:16:32,800 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-01-01 17:16:32,800 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 1 variables, input treesize:173, output treesize:121 [2019-01-01 17:16:33,330 WARN L181 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2019-01-01 17:16:33,346 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:16:33,348 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 17:16:33,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 28 [2019-01-01 17:16:33,349 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-01-01 17:16:33,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-01-01 17:16:33,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=713, Unknown=0, NotChecked=0, Total=812 [2019-01-01 17:16:33,350 INFO L87 Difference]: Start difference. First operand 200 states and 223 transitions. Second operand 29 states. [2019-01-01 17:16:35,033 WARN L181 SmtUtils]: Spent 360.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-01-01 17:16:35,990 WARN L181 SmtUtils]: Spent 711.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2019-01-01 17:16:36,701 WARN L181 SmtUtils]: Spent 461.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 64 [2019-01-01 17:16:37,159 WARN L181 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 44 [2019-01-01 17:16:37,513 WARN L181 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 38 [2019-01-01 17:16:38,133 WARN L181 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 43 [2019-01-01 17:16:39,660 WARN L181 SmtUtils]: Spent 1.34 s on a formula simplification. DAG size of input: 64 DAG size of output: 49 [2019-01-01 17:16:40,420 WARN L181 SmtUtils]: Spent 488.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 56 [2019-01-01 17:16:40,912 WARN L181 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 44 [2019-01-01 17:16:41,247 WARN L181 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 39 [2019-01-01 17:16:41,706 WARN L181 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2019-01-01 17:16:42,514 WARN L181 SmtUtils]: Spent 620.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 53 [2019-01-01 17:16:43,107 WARN L181 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-01-01 17:16:43,994 WARN L181 SmtUtils]: Spent 518.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 71 [2019-01-01 17:16:44,604 WARN L181 SmtUtils]: Spent 380.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 63 [2019-01-01 17:16:45,558 WARN L181 SmtUtils]: Spent 607.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 77 [2019-01-01 17:16:47,784 WARN L181 SmtUtils]: Spent 1.93 s on a formula simplification. DAG size of input: 84 DAG size of output: 81 [2019-01-01 17:16:49,129 WARN L181 SmtUtils]: Spent 947.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 85 [2019-01-01 17:16:49,793 WARN L181 SmtUtils]: Spent 237.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2019-01-01 17:16:50,444 WARN L181 SmtUtils]: Spent 413.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2019-01-01 17:16:51,728 WARN L181 SmtUtils]: Spent 838.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 62 [2019-01-01 17:16:52,720 WARN L181 SmtUtils]: Spent 633.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 66 [2019-01-01 17:16:53,783 WARN L181 SmtUtils]: Spent 709.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 70 [2019-01-01 17:16:54,274 WARN L181 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2019-01-01 17:16:54,858 WARN L181 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2019-01-01 17:16:55,906 WARN L181 SmtUtils]: Spent 740.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 49 [2019-01-01 17:16:56,684 WARN L181 SmtUtils]: Spent 436.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2019-01-01 17:16:57,499 WARN L181 SmtUtils]: Spent 440.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 57 [2019-01-01 17:17:00,082 WARN L181 SmtUtils]: Spent 1.58 s on a formula simplification that was a NOOP. DAG size: 35 [2019-01-01 17:17:01,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:17:01,079 INFO L93 Difference]: Finished difference Result 385 states and 428 transitions. [2019-01-01 17:17:01,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-01-01 17:17:01,084 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 33 [2019-01-01 17:17:01,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:17:01,090 INFO L225 Difference]: With dead ends: 385 [2019-01-01 17:17:01,091 INFO L226 Difference]: Without dead ends: 385 [2019-01-01 17:17:01,093 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 733 ImplicationChecksByTransitivity, 28.0s TimeCoverageRelationStatistics Valid=697, Invalid=3209, Unknown=0, NotChecked=0, Total=3906 [2019-01-01 17:17:01,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2019-01-01 17:17:01,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 310. [2019-01-01 17:17:01,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2019-01-01 17:17:01,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 353 transitions. [2019-01-01 17:17:01,107 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 353 transitions. Word has length 33 [2019-01-01 17:17:01,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:17:01,110 INFO L480 AbstractCegarLoop]: Abstraction has 310 states and 353 transitions. [2019-01-01 17:17:01,110 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-01-01 17:17:01,110 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 353 transitions. [2019-01-01 17:17:01,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-01-01 17:17:01,111 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:17:01,111 INFO L402 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:17:01,111 INFO L423 AbstractCegarLoop]: === Iteration 21 === [cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2019-01-01 17:17:01,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:17:01,117 INFO L82 PathProgramCache]: Analyzing trace with hash -847293160, now seen corresponding path program 3 times [2019-01-01 17:17:01,117 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-01 17:17:01,118 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 22 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-01 17:17:01,154 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2019-01-01 17:17:01,611 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-01-01 17:17:01,611 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 17:17:01,646 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 17:17:02,012 WARN L181 SmtUtils]: Spent 188.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-01-01 17:17:02,027 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 5 treesize of output 1 [2019-01-01 17:17:02,027 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 17:17:02,099 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2019-01-01 17:17:02,106 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 12 treesize of output 15 [2019-01-01 17:17:02,106 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-01 17:17:02,117 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:17:02,145 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:17:02,146 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:31, output treesize:28 [2019-01-01 17:17:02,190 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 14 [2019-01-01 17:17:02,195 INFO L478 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 14 treesize of output 13 [2019-01-01 17:17:02,195 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:17:02,201 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:17:02,230 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:17:02,231 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:44, output treesize:40 [2019-01-01 17:17:02,293 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2019-01-01 17:17:02,299 INFO L478 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 13 treesize of output 12 [2019-01-01 17:17:02,299 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:17:02,309 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:17:02,347 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:17:02,348 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:73, output treesize:46 [2019-01-01 17:17:03,051 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2019-01-01 17:17:03,059 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 1 [2019-01-01 17:17:03,059 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:17:03,099 INFO L478 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 20 [2019-01-01 17:17:03,100 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-01 17:17:03,119 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-01 17:17:03,180 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-01-01 17:17:03,180 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:65, output treesize:70 [2019-01-01 17:17:03,731 WARN L181 SmtUtils]: Spent 426.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 35 [2019-01-01 17:17:04,255 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 6 proven. 32 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-01-01 17:17:04,256 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-01 17:17:52,826 WARN L181 SmtUtils]: Spent 423.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 56 [2019-01-01 17:17:52,852 INFO L478 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 0 case distinctions, treesize of input 70 treesize of output 71 [2019-01-01 17:17:52,868 INFO L478 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 13 treesize of output 12 [2019-01-01 17:17:52,868 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:17:53,024 INFO L478 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 35 [2019-01-01 17:17:53,163 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 36 [2019-01-01 17:17:53,181 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 18 [2019-01-01 17:17:53,181 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 17:17:53,289 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 17:17:53,290 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 17:17:53,293 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 23 [2019-01-01 17:17:53,294 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-01 17:17:53,371 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2019-01-01 17:17:53,372 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-01 17:17:53,425 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 17:17:53,551 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-01 17:17:53,946 INFO L478 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 0 case distinctions, treesize of input 68 treesize of output 69 [2019-01-01 17:17:53,973 INFO L478 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 13 treesize of output 12 [2019-01-01 17:17:53,975 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-01 17:17:54,163 INFO L478 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 35 [2019-01-01 17:17:54,306 WARN L181 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 36 [2019-01-01 17:17:54,326 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2019-01-01 17:17:54,327 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-01 17:17:54,440 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 9 [2019-01-01 17:17:54,440 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-01 17:17:56,536 WARN L670 Elim1Store]: solver failed to check if following equality is implied: (= (bvadd v_prenex_40 (_ bv4294967295 32)) (bvadd main_~nondetString1~0.offset main_~length1~0 (_ bv4294967295 32))) [2019-01-01 17:17:56,542 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 17:17:56,544 INFO L303 Elim1Store]: Index analysis took 2033 ms [2019-01-01 17:17:56,545 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 23 [2019-01-01 17:17:56,546 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-01 17:17:56,609 INFO L267 ElimStorePlain]: Start of recursive call 10: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 17:17:56,737 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-01 17:17:57,099 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2019-01-01 17:17:57,099 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 4 variables, input treesize:151, output treesize:175 [2019-01-01 17:17:58,715 WARN L181 SmtUtils]: Spent 518.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2019-01-01 17:17:58,892 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-01-01 17:17:58,894 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 17:17:58,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12] total 27 [2019-01-01 17:17:58,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-01-01 17:17:58,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-01-01 17:17:58,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=671, Unknown=9, NotChecked=0, Total=756 [2019-01-01 17:17:58,896 INFO L87 Difference]: Start difference. First operand 310 states and 353 transitions. Second operand 28 states. [2019-01-01 17:18:10,869 WARN L181 SmtUtils]: Spent 920.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-01-01 17:18:15,876 WARN L181 SmtUtils]: Spent 4.24 s on a formula simplification. DAG size of input: 69 DAG size of output: 50 [2019-01-01 17:18:18,170 WARN L181 SmtUtils]: Spent 724.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2019-01-01 17:18:22,830 WARN L181 SmtUtils]: Spent 4.15 s on a formula simplification. DAG size of input: 59 DAG size of output: 43 [2019-01-01 17:18:32,050 WARN L181 SmtUtils]: Spent 8.57 s on a formula simplification. DAG size of input: 96 DAG size of output: 72 [2019-01-01 17:18:32,480 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2019-01-01 17:18:41,818 WARN L181 SmtUtils]: Spent 8.58 s on a formula simplification. DAG size of input: 95 DAG size of output: 71 [2019-01-01 17:18:56,420 WARN L181 SmtUtils]: Spent 13.08 s on a formula simplification. DAG size of input: 124 DAG size of output: 92 [2019-01-01 17:18:57,049 WARN L181 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-01-01 17:19:12,094 WARN L181 SmtUtils]: Spent 13.68 s on a formula simplification. DAG size of input: 148 DAG size of output: 100 [2019-01-01 17:19:13,872 WARN L181 SmtUtils]: Spent 696.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2019-01-01 17:19:29,692 WARN L181 SmtUtils]: Spent 14.53 s on a formula simplification. DAG size of input: 171 DAG size of output: 109 [2019-01-01 17:19:32,944 WARN L181 SmtUtils]: Spent 1.61 s on a formula simplification. DAG size of input: 107 DAG size of output: 104 [2019-01-01 17:19:48,979 WARN L181 SmtUtils]: Spent 14.81 s on a formula simplification. DAG size of input: 175 DAG size of output: 116 [2019-01-01 17:19:52,810 WARN L181 SmtUtils]: Spent 1.57 s on a formula simplification. DAG size of input: 111 DAG size of output: 108 [2019-01-01 17:20:09,159 WARN L181 SmtUtils]: Spent 14.39 s on a formula simplification. DAG size of input: 146 DAG size of output: 103 [2019-01-01 17:20:10,628 WARN L181 SmtUtils]: Spent 355.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-01-01 17:20:26,264 WARN L181 SmtUtils]: Spent 14.36 s on a formula simplification. DAG size of input: 133 DAG size of output: 93 [2019-01-01 17:20:27,677 WARN L181 SmtUtils]: Spent 460.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2019-01-01 17:20:43,098 WARN L181 SmtUtils]: Spent 14.03 s on a formula simplification. DAG size of input: 156 DAG size of output: 100 [2019-01-01 17:20:45,742 WARN L181 SmtUtils]: Spent 1.22 s on a formula simplification. DAG size of input: 103 DAG size of output: 100 [2019-01-01 17:21:01,498 WARN L181 SmtUtils]: Spent 14.56 s on a formula simplification. DAG size of input: 179 DAG size of output: 108 [2019-01-01 17:21:18,395 WARN L181 SmtUtils]: Spent 14.80 s on a formula simplification. DAG size of input: 183 DAG size of output: 111 [2019-01-01 17:21:19,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:21:19,877 INFO L93 Difference]: Finished difference Result 309 states and 347 transitions. [2019-01-01 17:21:19,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-01-01 17:21:19,882 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 53 [2019-01-01 17:21:19,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:21:19,884 INFO L225 Difference]: With dead ends: 309 [2019-01-01 17:21:19,884 INFO L226 Difference]: Without dead ends: 263 [2019-01-01 17:21:19,888 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 72 SyntacticMatches, 7 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 482 ImplicationChecksByTransitivity, 239.7s TimeCoverageRelationStatistics Valid=391, Invalid=2249, Unknown=12, NotChecked=0, Total=2652 [2019-01-01 17:21:19,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2019-01-01 17:21:19,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 103. [2019-01-01 17:21:19,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-01-01 17:21:19,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 110 transitions. [2019-01-01 17:21:19,893 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 110 transitions. Word has length 53 [2019-01-01 17:21:19,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:21:19,893 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 110 transitions. [2019-01-01 17:21:19,893 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-01-01 17:21:19,893 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 110 transitions. [2019-01-01 17:21:19,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-01-01 17:21:19,898 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:21:19,898 INFO L402 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:21:19,898 INFO L423 AbstractCegarLoop]: === Iteration 22 === [cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2019-01-01 17:21:19,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:21:19,899 INFO L82 PathProgramCache]: Analyzing trace with hash -196194070, now seen corresponding path program 3 times [2019-01-01 17:21:19,900 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-01 17:21:19,900 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 23 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-01 17:21:19,931 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-01 17:21:20,236 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-01-01 17:21:20,236 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 17:21:20,241 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 17:21:20,293 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 5 treesize of output 1 [2019-01-01 17:21:20,293 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 17:21:20,320 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2019-01-01 17:21:20,328 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 12 treesize of output 15 [2019-01-01 17:21:20,329 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-01 17:21:20,342 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:21:20,370 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:21:20,370 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:31, output treesize:28 [2019-01-01 17:21:20,415 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-01-01 17:21:20,420 INFO L478 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 13 treesize of output 12 [2019-01-01 17:21:20,420 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:21:20,425 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:21:20,476 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:21:20,477 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:61, output treesize:44 [2019-01-01 17:21:20,545 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2019-01-01 17:21:20,550 INFO L478 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 14 treesize of output 13 [2019-01-01 17:21:20,551 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:21:20,562 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:21:20,598 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:21:20,599 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:58, output treesize:54 [2019-01-01 17:21:21,000 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2019-01-01 17:21:21,023 INFO L478 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 20 [2019-01-01 17:21:21,024 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-01 17:21:21,066 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 1 [2019-01-01 17:21:21,066 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-01 17:21:21,092 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-01 17:21:21,161 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-01 17:21:21,161 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:80, output treesize:80 [2019-01-01 17:21:21,674 WARN L181 SmtUtils]: Spent 418.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 28 [2019-01-01 17:21:22,388 WARN L181 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 36 [2019-01-01 17:21:22,770 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 4 proven. 34 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2019-01-01 17:21:22,770 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-01 17:21:27,564 WARN L181 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-01-01 17:22:00,370 INFO L478 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 0 case distinctions, treesize of input 103 treesize of output 92 [2019-01-01 17:22:00,800 WARN L181 SmtUtils]: Spent 428.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 46 [2019-01-01 17:22:00,817 INFO L478 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 13 treesize of output 12 [2019-01-01 17:22:00,818 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:22:00,984 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2019-01-01 17:22:03,000 WARN L670 Elim1Store]: solver failed to check if following equality is implied: (= (bvadd v_prenex_56 (_ bv4294967295 32)) (bvadd main_~nondetString1~0.offset main_~length1~0 (_ bv4294967295 32))) [2019-01-01 17:22:03,005 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 17:22:03,007 INFO L303 Elim1Store]: Index analysis took 2022 ms [2019-01-01 17:22:03,008 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2019-01-01 17:22:03,008 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 17:22:03,042 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 17:22:03,189 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-01-01 17:22:03,771 INFO L478 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 0 case distinctions, treesize of input 81 treesize of output 70 [2019-01-01 17:22:04,067 WARN L181 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 44 [2019-01-01 17:22:04,084 INFO L478 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 13 treesize of output 12 [2019-01-01 17:22:04,084 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-01 17:22:04,218 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2019-01-01 17:22:04,236 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 17:22:04,237 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 17:22:04,239 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2019-01-01 17:22:04,240 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 17:22:04,277 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 17:22:04,401 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-01-01 17:22:04,940 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2019-01-01 17:22:04,940 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:205, output treesize:181 [2019-01-01 17:22:06,597 WARN L181 SmtUtils]: Spent 602.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2019-01-01 17:22:06,853 WARN L181 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 1 [2019-01-01 17:22:06,854 INFO L267 ElimStorePlain]: Start of recursive call 1: End of recursive call: and 1 xjuncts. [2019-01-01 17:22:06,854 INFO L202 ElimStorePlain]: Needed 1 recursive calls to eliminate 20 variables, input treesize:221, output treesize:1 [2019-01-01 17:22:06,893 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2019-01-01 17:22:06,896 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 17:22:06,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 26 [2019-01-01 17:22:06,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-01-01 17:22:06,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-01-01 17:22:06,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=620, Unknown=8, NotChecked=0, Total=702 [2019-01-01 17:22:06,898 INFO L87 Difference]: Start difference. First operand 103 states and 110 transitions. Second operand 27 states. [2019-01-01 17:22:08,272 WARN L181 SmtUtils]: Spent 614.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2019-01-01 17:22:12,806 WARN L181 SmtUtils]: Spent 4.20 s on a formula simplification. DAG size of input: 71 DAG size of output: 49 [2019-01-01 17:22:14,826 WARN L181 SmtUtils]: Spent 1.17 s on a formula simplification that was a NOOP. DAG size: 100 [2019-01-01 17:22:19,671 WARN L181 SmtUtils]: Spent 4.20 s on a formula simplification. DAG size of input: 76 DAG size of output: 53 [2019-01-01 17:22:21,448 WARN L181 SmtUtils]: Spent 1.01 s on a formula simplification that was a NOOP. DAG size: 94 [2019-01-01 17:22:26,033 WARN L181 SmtUtils]: Spent 4.15 s on a formula simplification. DAG size of input: 67 DAG size of output: 47 [2019-01-01 17:22:34,995 WARN L181 SmtUtils]: Spent 8.43 s on a formula simplification. DAG size of input: 103 DAG size of output: 75 [2019-01-01 17:23:00,926 WARN L181 SmtUtils]: Spent 24.73 s on a formula simplification. DAG size of input: 141 DAG size of output: 95 [2019-01-01 17:23:02,506 WARN L181 SmtUtils]: Spent 1.00 s on a formula simplification that was a NOOP. DAG size: 104 [2019-01-01 17:23:24,828 WARN L181 SmtUtils]: Spent 21.33 s on a formula simplification. DAG size of input: 154 DAG size of output: 101 [2019-01-01 17:23:27,730 WARN L181 SmtUtils]: Spent 1.79 s on a formula simplification. DAG size of input: 118 DAG size of output: 115 [2019-01-01 17:23:37,661 WARN L181 SmtUtils]: Spent 8.96 s on a formula simplification. DAG size of input: 124 DAG size of output: 94 [2019-01-01 17:23:38,670 WARN L181 SmtUtils]: Spent 350.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2019-01-01 17:23:48,499 WARN L181 SmtUtils]: Spent 8.87 s on a formula simplification. DAG size of input: 129 DAG size of output: 86 [2019-01-01 17:23:59,198 WARN L181 SmtUtils]: Spent 9.10 s on a formula simplification. DAG size of input: 136 DAG size of output: 92 [2019-01-01 17:24:00,409 WARN L181 SmtUtils]: Spent 515.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2019-01-01 17:24:10,124 WARN L181 SmtUtils]: Spent 8.65 s on a formula simplification. DAG size of input: 121 DAG size of output: 79 [2019-01-01 17:24:11,025 WARN L181 SmtUtils]: Spent 261.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2019-01-01 17:24:33,280 WARN L181 SmtUtils]: Spent 20.98 s on a formula simplification. DAG size of input: 152 DAG size of output: 94 [2019-01-01 17:24:35,768 WARN L181 SmtUtils]: Spent 1.47 s on a formula simplification. DAG size of input: 104 DAG size of output: 101 [2019-01-01 17:24:58,583 WARN L181 SmtUtils]: Spent 21.53 s on a formula simplification. DAG size of input: 165 DAG size of output: 101 [2019-01-01 17:24:59,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:24:59,132 INFO L93 Difference]: Finished difference Result 117 states and 123 transitions. [2019-01-01 17:24:59,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-01-01 17:24:59,136 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 55 [2019-01-01 17:24:59,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:24:59,137 INFO L225 Difference]: With dead ends: 117 [2019-01-01 17:24:59,137 INFO L226 Difference]: Without dead ends: 0 [2019-01-01 17:24:59,138 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 77 SyntacticMatches, 7 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 450 ImplicationChecksByTransitivity, 207.9s TimeCoverageRelationStatistics Valid=319, Invalid=2025, Unknown=8, NotChecked=0, Total=2352 [2019-01-01 17:24:59,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-01 17:24:59,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-01 17:24:59,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-01 17:24:59,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-01 17:24:59,138 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 55 [2019-01-01 17:24:59,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:24:59,138 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 17:24:59,138 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-01-01 17:24:59,139 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-01 17:24:59,139 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-01 17:24:59,145 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.01 05:24:59 BoogieIcfgContainer [2019-01-01 17:24:59,145 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-01 17:24:59,145 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 17:24:59,145 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 17:24:59,146 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 17:24:59,146 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 05:13:52" (3/4) ... [2019-01-01 17:24:59,150 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-01 17:24:59,157 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-01-01 17:24:59,157 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure cstrcspn [2019-01-01 17:24:59,157 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2019-01-01 17:24:59,158 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2019-01-01 17:24:59,158 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-01-01 17:24:59,164 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2019-01-01 17:24:59,164 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-01-01 17:24:59,164 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-01-01 17:24:59,201 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.witnessprinter has thrown an exception: java.lang.NullPointerException at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSLBacktranslationValueProvider.getStringFromIASTNode(CACSLBacktranslationValueProvider.java:78) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSLBacktranslationValueProvider.getStringFromStep(CACSLBacktranslationValueProvider.java:59) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSLBacktranslationValueProvider.getStringFromStep(CACSLBacktranslationValueProvider.java:1) at de.uni_freiburg.informatik.ultimate.witnessprinter.graphml.GeneratedWitnessEdge.getSourceCode(GeneratedWitnessEdge.java:153) at de.uni_freiburg.informatik.ultimate.witnessprinter.CorrectnessWitnessGenerator.lambda$2(CorrectnessWitnessGenerator.java:95) at edu.uci.ics.jung.io.GraphMLWriter.writeEdgeData(GraphMLWriter.java:237) at de.uni_freiburg.informatik.ultimate.witnessprinter.graphml.UltimateGraphMLWriter.save(UltimateGraphMLWriter.java:106) at de.uni_freiburg.informatik.ultimate.witnessprinter.CorrectnessWitnessGenerator.makeGraphMLString(CorrectnessWitnessGenerator.java:116) at de.uni_freiburg.informatik.ultimate.witnessprinter.WitnessPrinter.generateProofWitness(WitnessPrinter.java:165) at de.uni_freiburg.informatik.ultimate.witnessprinter.WitnessPrinter.finish(WitnessPrinter.java:145) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:131) 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-01-01 17:24:59,205 INFO L168 Benchmark]: Toolchain (without parser) took 668043.34 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 253.8 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -194.8 MB). Peak memory consumption was 59.0 MB. Max. memory is 11.5 GB. [2019-01-01 17:24:59,206 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 17:24:59,207 INFO L168 Benchmark]: CACSL2BoogieTranslator took 756.74 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -165.3 MB). Peak memory consumption was 30.2 MB. Max. memory is 11.5 GB. [2019-01-01 17:24:59,207 INFO L168 Benchmark]: Boogie Preprocessor took 71.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-01-01 17:24:59,207 INFO L168 Benchmark]: RCFGBuilder took 961.15 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: 47.4 MB). Peak memory consumption was 47.4 MB. Max. memory is 11.5 GB. [2019-01-01 17:24:59,207 INFO L168 Benchmark]: TraceAbstraction took 666190.11 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 115.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -77.1 MB). Peak memory consumption was 38.8 MB. Max. memory is 11.5 GB. [2019-01-01 17:24:59,208 INFO L168 Benchmark]: Witness Printer took 59.28 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 150.1 kB). Peak memory consumption was 150.1 kB. Max. memory is 11.5 GB. [2019-01-01 17:24:59,209 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 756.74 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -165.3 MB). Peak memory consumption was 30.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 71.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 961.15 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: 47.4 MB). Peak memory consumption was 47.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 666190.11 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 115.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -77.1 MB). Peak memory consumption was 38.8 MB. Max. memory is 11.5 GB. * Witness Printer took 59.28 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 150.1 kB). Peak memory consumption was 150.1 kB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 546]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 546]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 549]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 549]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 565]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 554]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 565]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 566]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 566]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 9 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 43 locations, 9 error locations. SAFE Result, 666.1s OverallTime, 22 OverallIterations, 8 TraceHistogramMax, 508.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 498 SDtfs, 1149 SDslu, 2712 SDs, 0 SdLazy, 3675 SolverSat, 344 SolverUnsat, 15 SolverUnknown, 0 SolverNotchecked, 63.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 918 GetRequests, 431 SyntacticMatches, 28 SemanticMatches, 459 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3758 ImplicationChecksByTransitivity, 565.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=310occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 22 MinimizatonAttempts, 363 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 2.2s SatisfiabilityAnalysisTime, 153.8s InterpolantComputationTime, 478 NumberOfCodeBlocks, 478 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 695 ConstructedInterpolants, 214 QuantifiedInterpolants, 865262 SizeOfPredicates, 258 NumberOfNonLiveVariables, 1847 ConjunctsInSsa, 415 ConjunctsInUnsatCore, 29 InterpolantComputations, 15 PerfectInterpolantSequences, 280/514 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available * Results from de.uni_freiburg.informatik.ultimate.witnessprinter: - ExceptionOrErrorResult: NullPointerException: null de.uni_freiburg.informatik.ultimate.witnessprinter: NullPointerException: null: de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSLBacktranslationValueProvider.getStringFromIASTNode(CACSLBacktranslationValueProvider.java:78) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...