./Ultimate.py --spec /storage/repos/svcomp/c/properties/valid-memsafety.prp --file /storage/repos/svcomp/c/list-ext-properties/test-0232_1_false-valid-memtrack_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0ed9222f 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/list-ext-properties/test-0232_1_false-valid-memtrack_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 dd0b9292151174331f3cf63e5ad3d651d29dfbcc .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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/list-ext-properties/test-0232_1_false-valid-memtrack_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 dd0b9292151174331f3cf63e5ad3d651d29dfbcc ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 18:53:36,244 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 18:53:36,246 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 18:53:36,262 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 18:53:36,263 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 18:53:36,266 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 18:53:36,268 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 18:53:36,271 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 18:53:36,272 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 18:53:36,274 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 18:53:36,275 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 18:53:36,275 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 18:53:36,278 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 18:53:36,281 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 18:53:36,288 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 18:53:36,289 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 18:53:36,292 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 18:53:36,293 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 18:53:36,298 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 18:53:36,300 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 18:53:36,301 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 18:53:36,303 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 18:53:36,306 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 18:53:36,306 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 18:53:36,307 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 18:53:36,307 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 18:53:36,308 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 18:53:36,311 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 18:53:36,311 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 18:53:36,312 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 18:53:36,312 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 18:53:36,313 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 18:53:36,313 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 18:53:36,313 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 18:53:36,316 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 18:53:36,316 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 18:53:36,317 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-01-14 18:53:36,343 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 18:53:36,343 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 18:53:36,344 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 18:53:36,344 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 18:53:36,344 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 18:53:36,345 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 18:53:36,346 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 18:53:36,346 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 18:53:36,346 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 18:53:36,346 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 18:53:36,346 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 18:53:36,346 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-01-14 18:53:36,347 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2019-01-14 18:53:36,347 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-01-14 18:53:36,347 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-14 18:53:36,347 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 18:53:36,347 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 18:53:36,347 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 18:53:36,348 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-14 18:53:36,349 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-14 18:53:36,349 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 18:53:36,349 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 18:53:36,349 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-14 18:53:36,349 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 18:53:36,350 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-14 18:53:36,350 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 -> dd0b9292151174331f3cf63e5ad3d651d29dfbcc [2019-01-14 18:53:36,387 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 18:53:36,404 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 18:53:36,410 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 18:53:36,412 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 18:53:36,414 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 18:53:36,415 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/list-ext-properties/test-0232_1_false-valid-memtrack_true-termination.i [2019-01-14 18:53:36,475 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a135122a6/522d646d6d07474bb25393969290bc1f/FLAG09b0efb59 [2019-01-14 18:53:36,978 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 18:53:36,979 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/list-ext-properties/test-0232_1_false-valid-memtrack_true-termination.i [2019-01-14 18:53:36,991 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a135122a6/522d646d6d07474bb25393969290bc1f/FLAG09b0efb59 [2019-01-14 18:53:37,291 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a135122a6/522d646d6d07474bb25393969290bc1f [2019-01-14 18:53:37,294 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 18:53:37,296 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-01-14 18:53:37,297 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 18:53:37,297 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 18:53:37,301 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 18:53:37,301 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 06:53:37" (1/1) ... [2019-01-14 18:53:37,304 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a4f7345 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:53:37, skipping insertion in model container [2019-01-14 18:53:37,305 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 06:53:37" (1/1) ... [2019-01-14 18:53:37,312 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 18:53:37,358 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 18:53:37,681 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 18:53:37,695 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 18:53:37,867 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 18:53:37,934 INFO L195 MainTranslator]: Completed translation [2019-01-14 18:53:37,934 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:53:37 WrapperNode [2019-01-14 18:53:37,935 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 18:53:37,935 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 18:53:37,935 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 18:53:37,935 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 18:53:37,948 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:53:37" (1/1) ... [2019-01-14 18:53:37,949 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:53:37" (1/1) ... [2019-01-14 18:53:37,963 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:53:37" (1/1) ... [2019-01-14 18:53:37,964 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:53:37" (1/1) ... [2019-01-14 18:53:37,991 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:53:37" (1/1) ... [2019-01-14 18:53:38,001 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:53:37" (1/1) ... [2019-01-14 18:53:38,007 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:53:37" (1/1) ... [2019-01-14 18:53:38,020 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 18:53:38,021 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 18:53:38,021 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 18:53:38,021 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 18:53:38,022 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:53:37" (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-14 18:53:38,077 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-01-14 18:53:38,077 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 18:53:38,077 INFO L138 BoogieDeclarations]: Found implementation of procedure append [2019-01-14 18:53:38,077 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-14 18:53:38,077 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-01-14 18:53:38,078 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-01-14 18:53:38,078 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-01-14 18:53:38,078 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-01-14 18:53:38,078 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-01-14 18:53:38,078 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-01-14 18:53:38,078 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-01-14 18:53:38,078 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-01-14 18:53:38,079 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-01-14 18:53:38,079 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-01-14 18:53:38,079 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-01-14 18:53:38,079 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-01-14 18:53:38,079 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-01-14 18:53:38,079 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-01-14 18:53:38,081 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-01-14 18:53:38,082 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-01-14 18:53:38,082 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-01-14 18:53:38,082 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-01-14 18:53:38,082 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-01-14 18:53:38,082 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-01-14 18:53:38,082 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-01-14 18:53:38,083 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-01-14 18:53:38,084 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-01-14 18:53:38,084 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-01-14 18:53:38,084 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-01-14 18:53:38,084 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-01-14 18:53:38,084 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-01-14 18:53:38,084 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-01-14 18:53:38,085 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-01-14 18:53:38,085 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-01-14 18:53:38,086 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-01-14 18:53:38,086 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-01-14 18:53:38,086 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-01-14 18:53:38,086 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-01-14 18:53:38,086 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-01-14 18:53:38,086 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-01-14 18:53:38,087 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-01-14 18:53:38,087 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-01-14 18:53:38,088 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-01-14 18:53:38,088 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-01-14 18:53:38,088 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-01-14 18:53:38,088 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-01-14 18:53:38,088 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-01-14 18:53:38,088 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-01-14 18:53:38,089 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-01-14 18:53:38,089 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-01-14 18:53:38,089 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-01-14 18:53:38,089 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-01-14 18:53:38,089 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-01-14 18:53:38,089 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-01-14 18:53:38,089 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-01-14 18:53:38,091 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-01-14 18:53:38,091 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-01-14 18:53:38,091 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-01-14 18:53:38,092 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-01-14 18:53:38,092 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-01-14 18:53:38,092 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-01-14 18:53:38,092 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-01-14 18:53:38,092 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-01-14 18:53:38,092 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-01-14 18:53:38,092 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-01-14 18:53:38,094 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-01-14 18:53:38,094 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-01-14 18:53:38,094 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-01-14 18:53:38,094 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-01-14 18:53:38,094 INFO L130 BoogieDeclarations]: Found specification of procedure __secure_getenv [2019-01-14 18:53:38,094 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-01-14 18:53:38,095 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-01-14 18:53:38,095 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-01-14 18:53:38,095 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-01-14 18:53:38,095 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-01-14 18:53:38,095 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-01-14 18:53:38,095 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-01-14 18:53:38,095 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-01-14 18:53:38,096 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-01-14 18:53:38,097 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-01-14 18:53:38,097 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-01-14 18:53:38,097 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-01-14 18:53:38,097 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-01-14 18:53:38,098 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-01-14 18:53:38,098 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-01-14 18:53:38,098 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-01-14 18:53:38,099 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-01-14 18:53:38,099 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-01-14 18:53:38,099 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-01-14 18:53:38,099 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-01-14 18:53:38,099 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-01-14 18:53:38,099 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-01-14 18:53:38,099 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-01-14 18:53:38,099 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-01-14 18:53:38,100 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-01-14 18:53:38,100 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-01-14 18:53:38,100 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-01-14 18:53:38,100 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-01-14 18:53:38,100 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-01-14 18:53:38,100 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-01-14 18:53:38,100 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-01-14 18:53:38,100 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-01-14 18:53:38,100 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-01-14 18:53:38,101 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-01-14 18:53:38,103 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-01-14 18:53:38,103 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-01-14 18:53:38,103 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-01-14 18:53:38,103 INFO L130 BoogieDeclarations]: Found specification of procedure append [2019-01-14 18:53:38,103 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-14 18:53:38,103 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-01-14 18:53:38,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-01-14 18:53:38,104 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-14 18:53:38,105 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 18:53:38,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-01-14 18:53:38,105 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 18:53:38,105 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-01-14 18:53:38,105 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 18:53:39,058 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 18:53:39,058 INFO L286 CfgBuilder]: Removed 2 assue(true) statements. [2019-01-14 18:53:39,060 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 06:53:39 BoogieIcfgContainer [2019-01-14 18:53:39,060 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 18:53:39,061 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-14 18:53:39,061 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-14 18:53:39,064 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-14 18:53:39,064 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.01 06:53:37" (1/3) ... [2019-01-14 18:53:39,065 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f6fe846 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 06:53:39, skipping insertion in model container [2019-01-14 18:53:39,065 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:53:37" (2/3) ... [2019-01-14 18:53:39,066 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f6fe846 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 06:53:39, skipping insertion in model container [2019-01-14 18:53:39,066 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 06:53:39" (3/3) ... [2019-01-14 18:53:39,068 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0232_1_false-valid-memtrack_true-termination.i [2019-01-14 18:53:39,077 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-14 18:53:39,085 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 44 error locations. [2019-01-14 18:53:39,102 INFO L257 AbstractCegarLoop]: Starting to check reachability of 44 error locations. [2019-01-14 18:53:39,126 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 18:53:39,127 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-14 18:53:39,127 INFO L383 AbstractCegarLoop]: Hoare is false [2019-01-14 18:53:39,127 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-14 18:53:39,127 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 18:53:39,128 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 18:53:39,128 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-14 18:53:39,128 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 18:53:39,128 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-14 18:53:39,153 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states. [2019-01-14 18:53:39,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-14 18:53:39,166 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:53:39,167 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:53:39,170 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr28REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION]=== [2019-01-14 18:53:39,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:53:39,175 INFO L82 PathProgramCache]: Analyzing trace with hash 483918089, now seen corresponding path program 1 times [2019-01-14 18:53:39,176 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:53:39,177 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:53:39,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:53:39,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:53:39,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:53:39,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:53:39,522 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-14 18:53:39,525 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:53:39,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 18:53:39,530 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 18:53:39,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 18:53:39,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 18:53:39,549 INFO L87 Difference]: Start difference. First operand 99 states. Second operand 5 states. [2019-01-14 18:53:40,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:53:40,430 INFO L93 Difference]: Finished difference Result 126 states and 131 transitions. [2019-01-14 18:53:40,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 18:53:40,433 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-01-14 18:53:40,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:53:40,444 INFO L225 Difference]: With dead ends: 126 [2019-01-14 18:53:40,444 INFO L226 Difference]: Without dead ends: 123 [2019-01-14 18:53:40,446 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-14 18:53:40,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-01-14 18:53:40,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 102. [2019-01-14 18:53:40,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-01-14 18:53:40,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 115 transitions. [2019-01-14 18:53:40,489 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 115 transitions. Word has length 9 [2019-01-14 18:53:40,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:53:40,489 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 115 transitions. [2019-01-14 18:53:40,489 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 18:53:40,490 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 115 transitions. [2019-01-14 18:53:40,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-14 18:53:40,490 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:53:40,490 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:53:40,491 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr28REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION]=== [2019-01-14 18:53:40,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:53:40,491 INFO L82 PathProgramCache]: Analyzing trace with hash 483918090, now seen corresponding path program 1 times [2019-01-14 18:53:40,491 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:53:40,492 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:53:40,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:53:40,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:53:40,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:53:40,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:53:40,614 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-14 18:53:40,614 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:53:40,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 18:53:40,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 18:53:40,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 18:53:40,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 18:53:40,617 INFO L87 Difference]: Start difference. First operand 102 states and 115 transitions. Second operand 5 states. [2019-01-14 18:53:40,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:53:40,894 INFO L93 Difference]: Finished difference Result 101 states and 110 transitions. [2019-01-14 18:53:40,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 18:53:40,896 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-01-14 18:53:40,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:53:40,900 INFO L225 Difference]: With dead ends: 101 [2019-01-14 18:53:40,900 INFO L226 Difference]: Without dead ends: 101 [2019-01-14 18:53:40,901 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-14 18:53:40,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-01-14 18:53:40,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 97. [2019-01-14 18:53:40,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-01-14 18:53:40,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 108 transitions. [2019-01-14 18:53:40,911 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 108 transitions. Word has length 9 [2019-01-14 18:53:40,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:53:40,912 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 108 transitions. [2019-01-14 18:53:40,912 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 18:53:40,912 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 108 transitions. [2019-01-14 18:53:40,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-14 18:53:40,913 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:53:40,913 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:53:40,913 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr28REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION]=== [2019-01-14 18:53:40,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:53:40,914 INFO L82 PathProgramCache]: Analyzing trace with hash 2116558944, now seen corresponding path program 1 times [2019-01-14 18:53:40,914 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:53:40,914 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:53:40,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:53:40,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:53:40,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:53:40,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:53:40,953 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-14 18:53:40,955 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:53:40,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 18:53:40,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 18:53:40,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 18:53:40,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 18:53:40,957 INFO L87 Difference]: Start difference. First operand 97 states and 108 transitions. Second operand 3 states. [2019-01-14 18:53:41,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:53:41,080 INFO L93 Difference]: Finished difference Result 93 states and 103 transitions. [2019-01-14 18:53:41,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 18:53:41,081 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-01-14 18:53:41,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:53:41,082 INFO L225 Difference]: With dead ends: 93 [2019-01-14 18:53:41,082 INFO L226 Difference]: Without dead ends: 93 [2019-01-14 18:53:41,083 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-14 18:53:41,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-01-14 18:53:41,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2019-01-14 18:53:41,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-01-14 18:53:41,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 103 transitions. [2019-01-14 18:53:41,091 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 103 transitions. Word has length 10 [2019-01-14 18:53:41,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:53:41,091 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 103 transitions. [2019-01-14 18:53:41,091 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 18:53:41,091 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 103 transitions. [2019-01-14 18:53:41,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-14 18:53:41,092 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:53:41,092 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:53:41,093 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr28REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION]=== [2019-01-14 18:53:41,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:53:41,093 INFO L82 PathProgramCache]: Analyzing trace with hash 2116558945, now seen corresponding path program 1 times [2019-01-14 18:53:41,093 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:53:41,093 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:53:41,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:53:41,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:53:41,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:53:41,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:53:41,158 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-14 18:53:41,158 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:53:41,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 18:53:41,159 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 18:53:41,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 18:53:41,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 18:53:41,161 INFO L87 Difference]: Start difference. First operand 93 states and 103 transitions. Second operand 3 states. [2019-01-14 18:53:41,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:53:41,261 INFO L93 Difference]: Finished difference Result 89 states and 98 transitions. [2019-01-14 18:53:41,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 18:53:41,262 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-01-14 18:53:41,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:53:41,263 INFO L225 Difference]: With dead ends: 89 [2019-01-14 18:53:41,263 INFO L226 Difference]: Without dead ends: 89 [2019-01-14 18:53:41,264 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-14 18:53:41,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-01-14 18:53:41,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-01-14 18:53:41,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-01-14 18:53:41,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 98 transitions. [2019-01-14 18:53:41,270 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 98 transitions. Word has length 10 [2019-01-14 18:53:41,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:53:41,271 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 98 transitions. [2019-01-14 18:53:41,271 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 18:53:41,271 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 98 transitions. [2019-01-14 18:53:41,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-14 18:53:41,272 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:53:41,272 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:53:41,272 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr28REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION]=== [2019-01-14 18:53:41,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:53:41,273 INFO L82 PathProgramCache]: Analyzing trace with hash 1578128564, now seen corresponding path program 1 times [2019-01-14 18:53:41,273 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:53:41,273 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:53:41,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:53:41,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:53:41,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:53:41,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:53:41,496 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-14 18:53:41,496 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:53:41,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-14 18:53:41,497 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-14 18:53:41,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 18:53:41,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-01-14 18:53:41,498 INFO L87 Difference]: Start difference. First operand 89 states and 98 transitions. Second operand 8 states. [2019-01-14 18:53:41,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:53:41,869 INFO L93 Difference]: Finished difference Result 100 states and 110 transitions. [2019-01-14 18:53:41,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-14 18:53:41,870 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2019-01-14 18:53:41,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:53:41,872 INFO L225 Difference]: With dead ends: 100 [2019-01-14 18:53:41,872 INFO L226 Difference]: Without dead ends: 100 [2019-01-14 18:53:41,872 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2019-01-14 18:53:41,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-01-14 18:53:41,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 96. [2019-01-14 18:53:41,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-01-14 18:53:41,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 106 transitions. [2019-01-14 18:53:41,882 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 106 transitions. Word has length 15 [2019-01-14 18:53:41,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:53:41,882 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 106 transitions. [2019-01-14 18:53:41,882 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-14 18:53:41,883 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 106 transitions. [2019-01-14 18:53:41,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-14 18:53:41,883 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:53:41,883 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:53:41,884 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr28REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION]=== [2019-01-14 18:53:41,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:53:41,884 INFO L82 PathProgramCache]: Analyzing trace with hash 1677623365, now seen corresponding path program 1 times [2019-01-14 18:53:41,884 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:53:41,885 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:53:41,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:53:41,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:53:41,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:53:41,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:53:42,019 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-14 18:53:42,019 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:53:42,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 18:53:42,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 18:53:42,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 18:53:42,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-14 18:53:42,020 INFO L87 Difference]: Start difference. First operand 96 states and 106 transitions. Second operand 6 states. [2019-01-14 18:53:42,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:53:42,475 INFO L93 Difference]: Finished difference Result 95 states and 105 transitions. [2019-01-14 18:53:42,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 18:53:42,476 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-01-14 18:53:42,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:53:42,478 INFO L225 Difference]: With dead ends: 95 [2019-01-14 18:53:42,478 INFO L226 Difference]: Without dead ends: 95 [2019-01-14 18:53:42,479 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-01-14 18:53:42,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-01-14 18:53:42,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 92. [2019-01-14 18:53:42,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-01-14 18:53:42,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 102 transitions. [2019-01-14 18:53:42,485 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 102 transitions. Word has length 16 [2019-01-14 18:53:42,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:53:42,485 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 102 transitions. [2019-01-14 18:53:42,485 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 18:53:42,486 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 102 transitions. [2019-01-14 18:53:42,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-01-14 18:53:42,486 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:53:42,487 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, 1] [2019-01-14 18:53:42,487 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr28REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION]=== [2019-01-14 18:53:42,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:53:42,488 INFO L82 PathProgramCache]: Analyzing trace with hash 1052744250, now seen corresponding path program 1 times [2019-01-14 18:53:42,488 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:53:42,488 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:53:42,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:53:42,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:53:42,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:53:42,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:53:42,629 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-14 18:53:42,629 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:53:42,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-14 18:53:42,629 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 18:53:42,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 18:53:42,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-14 18:53:42,630 INFO L87 Difference]: Start difference. First operand 92 states and 102 transitions. Second operand 7 states. [2019-01-14 18:53:43,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:53:43,038 INFO L93 Difference]: Finished difference Result 108 states and 114 transitions. [2019-01-14 18:53:43,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 18:53:43,041 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2019-01-14 18:53:43,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:53:43,042 INFO L225 Difference]: With dead ends: 108 [2019-01-14 18:53:43,042 INFO L226 Difference]: Without dead ends: 108 [2019-01-14 18:53:43,043 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-01-14 18:53:43,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-01-14 18:53:43,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 92. [2019-01-14 18:53:43,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-01-14 18:53:43,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 101 transitions. [2019-01-14 18:53:43,049 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 101 transitions. Word has length 25 [2019-01-14 18:53:43,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:53:43,051 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 101 transitions. [2019-01-14 18:53:43,051 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 18:53:43,051 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 101 transitions. [2019-01-14 18:53:43,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-01-14 18:53:43,052 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:53:43,052 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, 1] [2019-01-14 18:53:43,053 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr28REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION]=== [2019-01-14 18:53:43,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:53:43,053 INFO L82 PathProgramCache]: Analyzing trace with hash 1052744251, now seen corresponding path program 1 times [2019-01-14 18:53:43,054 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:53:43,054 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:53:43,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:53:43,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:53:43,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:53:43,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:53:43,294 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-14 18:53:43,294 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:53:43,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-14 18:53:43,295 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 18:53:43,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 18:53:43,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-14 18:53:43,295 INFO L87 Difference]: Start difference. First operand 92 states and 101 transitions. Second operand 7 states. [2019-01-14 18:53:43,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:53:43,544 INFO L93 Difference]: Finished difference Result 102 states and 108 transitions. [2019-01-14 18:53:43,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 18:53:43,545 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2019-01-14 18:53:43,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:53:43,546 INFO L225 Difference]: With dead ends: 102 [2019-01-14 18:53:43,547 INFO L226 Difference]: Without dead ends: 102 [2019-01-14 18:53:43,547 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-01-14 18:53:43,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-01-14 18:53:43,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 91. [2019-01-14 18:53:43,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-01-14 18:53:43,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 99 transitions. [2019-01-14 18:53:43,554 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 99 transitions. Word has length 25 [2019-01-14 18:53:43,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:53:43,554 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 99 transitions. [2019-01-14 18:53:43,555 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 18:53:43,555 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 99 transitions. [2019-01-14 18:53:43,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-01-14 18:53:43,556 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:53:43,556 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, 1] [2019-01-14 18:53:43,556 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr28REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION]=== [2019-01-14 18:53:43,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:53:43,557 INFO L82 PathProgramCache]: Analyzing trace with hash 1052730316, now seen corresponding path program 1 times [2019-01-14 18:53:43,557 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:53:43,557 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:53:43,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:53:43,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:53:43,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:53:43,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:53:43,609 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-14 18:53:43,609 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:53:43,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 18:53:43,610 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 18:53:43,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 18:53:43,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 18:53:43,610 INFO L87 Difference]: Start difference. First operand 91 states and 99 transitions. Second operand 3 states. [2019-01-14 18:53:43,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:53:43,624 INFO L93 Difference]: Finished difference Result 74 states and 81 transitions. [2019-01-14 18:53:43,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 18:53:43,625 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-01-14 18:53:43,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:53:43,626 INFO L225 Difference]: With dead ends: 74 [2019-01-14 18:53:43,627 INFO L226 Difference]: Without dead ends: 74 [2019-01-14 18:53:43,628 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 18:53:43,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-01-14 18:53:43,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-01-14 18:53:43,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-01-14 18:53:43,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 81 transitions. [2019-01-14 18:53:43,632 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 81 transitions. Word has length 25 [2019-01-14 18:53:43,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:53:43,632 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 81 transitions. [2019-01-14 18:53:43,632 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 18:53:43,632 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2019-01-14 18:53:43,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-01-14 18:53:43,633 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:53:43,633 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, 1] [2019-01-14 18:53:43,634 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr28REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION]=== [2019-01-14 18:53:43,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:53:43,634 INFO L82 PathProgramCache]: Analyzing trace with hash 1053966446, now seen corresponding path program 1 times [2019-01-14 18:53:43,634 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:53:43,634 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:53:43,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:53:43,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:53:43,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:53:43,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:53:43,776 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-14 18:53:43,776 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:53:43,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 18:53:43,777 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 18:53:43,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 18:53:43,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 18:53:43,777 INFO L87 Difference]: Start difference. First operand 74 states and 81 transitions. Second operand 4 states. [2019-01-14 18:53:44,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:53:44,006 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2019-01-14 18:53:44,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 18:53:44,007 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-01-14 18:53:44,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:53:44,008 INFO L225 Difference]: With dead ends: 70 [2019-01-14 18:53:44,009 INFO L226 Difference]: Without dead ends: 70 [2019-01-14 18:53:44,009 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-14 18:53:44,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-01-14 18:53:44,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2019-01-14 18:53:44,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-01-14 18:53:44,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 72 transitions. [2019-01-14 18:53:44,014 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 72 transitions. Word has length 25 [2019-01-14 18:53:44,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:53:44,015 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 72 transitions. [2019-01-14 18:53:44,015 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 18:53:44,015 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 72 transitions. [2019-01-14 18:53:44,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-01-14 18:53:44,016 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:53:44,016 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, 1, 1, 1, 1] [2019-01-14 18:53:44,016 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr28REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION]=== [2019-01-14 18:53:44,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:53:44,017 INFO L82 PathProgramCache]: Analyzing trace with hash 452771287, now seen corresponding path program 1 times [2019-01-14 18:53:44,017 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:53:44,017 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:53:44,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:53:44,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:53:44,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:53:44,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:53:44,289 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-14 18:53:44,289 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:53:44,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 18:53:44,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 18:53:44,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 18:53:44,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-14 18:53:44,290 INFO L87 Difference]: Start difference. First operand 69 states and 72 transitions. Second operand 6 states. [2019-01-14 18:53:44,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:53:44,465 INFO L93 Difference]: Finished difference Result 68 states and 71 transitions. [2019-01-14 18:53:44,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 18:53:44,469 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-01-14 18:53:44,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:53:44,470 INFO L225 Difference]: With dead ends: 68 [2019-01-14 18:53:44,470 INFO L226 Difference]: Without dead ends: 68 [2019-01-14 18:53:44,471 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-01-14 18:53:44,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-01-14 18:53:44,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-01-14 18:53:44,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-01-14 18:53:44,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2019-01-14 18:53:44,474 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 28 [2019-01-14 18:53:44,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:53:44,474 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2019-01-14 18:53:44,474 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 18:53:44,474 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2019-01-14 18:53:44,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-01-14 18:53:44,475 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:53:44,475 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, 1, 1, 1, 1, 1] [2019-01-14 18:53:44,476 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr28REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION]=== [2019-01-14 18:53:44,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:53:44,476 INFO L82 PathProgramCache]: Analyzing trace with hash 1151008091, now seen corresponding path program 1 times [2019-01-14 18:53:44,476 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:53:44,476 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:53:44,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:53:44,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:53:44,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:53:44,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:53:44,691 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-14 18:53:44,691 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:53:44,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 18:53:44,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 18:53:44,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 18:53:44,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-14 18:53:44,692 INFO L87 Difference]: Start difference. First operand 68 states and 71 transitions. Second operand 6 states. [2019-01-14 18:53:44,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:53:44,909 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2019-01-14 18:53:44,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 18:53:44,910 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2019-01-14 18:53:44,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:53:44,912 INFO L225 Difference]: With dead ends: 67 [2019-01-14 18:53:44,912 INFO L226 Difference]: Without dead ends: 67 [2019-01-14 18:53:44,913 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-01-14 18:53:44,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-01-14 18:53:44,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-01-14 18:53:44,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-01-14 18:53:44,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 70 transitions. [2019-01-14 18:53:44,915 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 70 transitions. Word has length 29 [2019-01-14 18:53:44,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:53:44,915 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 70 transitions. [2019-01-14 18:53:44,916 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 18:53:44,916 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 70 transitions. [2019-01-14 18:53:44,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-14 18:53:44,917 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:53:44,917 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:53:44,919 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr28REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION]=== [2019-01-14 18:53:44,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:53:44,919 INFO L82 PathProgramCache]: Analyzing trace with hash -1342664407, now seen corresponding path program 1 times [2019-01-14 18:53:44,919 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:53:44,920 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:53:44,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:53:44,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:53:44,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:53:44,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:53:45,693 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 12 [2019-01-14 18:53:45,806 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:53:45,806 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 18:53:45,806 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-14 18:53:45,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:53:45,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:53:45,881 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 18:53:45,976 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 11 treesize of output 8 [2019-01-14 18:53:45,978 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 8 treesize of output 7 [2019-01-14 18:53:45,979 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:53:45,983 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:53:45,991 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-14 18:53:45,992 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2019-01-14 18:53:46,163 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 16 treesize of output 15 [2019-01-14 18:53:46,164 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 18:53:46,188 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:53:46,189 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2019-01-14 18:53:46,357 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 35 [2019-01-14 18:53:46,366 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 26 treesize of output 25 [2019-01-14 18:53:46,367 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:53:46,470 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:53:46,485 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-14 18:53:46,486 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2019-01-14 18:53:46,590 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 28 treesize of output 28 [2019-01-14 18:53:46,601 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 0 case distinctions, treesize of input 20 treesize of output 5 [2019-01-14 18:53:46,601 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:53:46,626 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:53:46,630 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 18:53:46,630 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:33, output treesize:11 [2019-01-14 18:53:46,644 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:53:46,671 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 18:53:46,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 16 [2019-01-14 18:53:46,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-14 18:53:46,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-14 18:53:46,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2019-01-14 18:53:46,675 INFO L87 Difference]: Start difference. First operand 67 states and 70 transitions. Second operand 17 states. [2019-01-14 18:53:47,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:53:47,824 INFO L93 Difference]: Finished difference Result 73 states and 75 transitions. [2019-01-14 18:53:47,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-14 18:53:47,825 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 30 [2019-01-14 18:53:47,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:53:47,827 INFO L225 Difference]: With dead ends: 73 [2019-01-14 18:53:47,827 INFO L226 Difference]: Without dead ends: 73 [2019-01-14 18:53:47,828 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 22 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=143, Invalid=507, Unknown=0, NotChecked=0, Total=650 [2019-01-14 18:53:47,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-01-14 18:53:47,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2019-01-14 18:53:47,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-01-14 18:53:47,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 73 transitions. [2019-01-14 18:53:47,831 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 73 transitions. Word has length 30 [2019-01-14 18:53:47,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:53:47,832 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 73 transitions. [2019-01-14 18:53:47,832 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-14 18:53:47,832 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 73 transitions. [2019-01-14 18:53:47,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-14 18:53:47,833 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:53:47,833 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:53:47,833 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr28REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION]=== [2019-01-14 18:53:47,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:53:47,834 INFO L82 PathProgramCache]: Analyzing trace with hash -1342664406, now seen corresponding path program 1 times [2019-01-14 18:53:47,834 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:53:47,834 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:53:47,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:53:47,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:53:47,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:53:47,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:53:48,272 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:53:48,272 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 18:53:48,272 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-14 18:53:48,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:53:48,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:53:48,324 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 18:53:48,369 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 11 treesize of output 8 [2019-01-14 18:53:48,372 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 8 treesize of output 7 [2019-01-14 18:53:48,373 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:53:48,375 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:53:48,395 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 11 treesize of output 8 [2019-01-14 18:53:48,398 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 8 treesize of output 7 [2019-01-14 18:53:48,399 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 18:53:48,401 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:53:48,408 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:53:48,408 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:33, output treesize:26 [2019-01-14 18:53:48,524 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 18:53:48,525 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 18:53:48,527 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2019-01-14 18:53:48,528 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 18:53:48,599 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 16 treesize of output 23 [2019-01-14 18:53:48,600 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:53:48,610 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:53:48,610 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:33 [2019-01-14 18:53:48,767 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 33 [2019-01-14 18:53:48,772 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 24 treesize of output 23 [2019-01-14 18:53:48,772 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:53:48,810 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:53:48,849 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 41 [2019-01-14 18:53:48,857 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 27 [2019-01-14 18:53:48,858 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 18:53:48,886 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 29 [2019-01-14 18:53:48,887 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-14 18:53:48,902 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:53:48,915 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 18:53:48,916 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:60, output treesize:52 [2019-01-14 18:53:49,008 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 1 case distinctions, treesize of input 36 treesize of output 34 [2019-01-14 18:53:49,024 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 30 treesize of output 23 [2019-01-14 18:53:49,025 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:53:49,046 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 23 treesize of output 14 [2019-01-14 18:53:49,047 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 18:53:49,068 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2019-01-14 18:53:49,069 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 18:53:49,080 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:53:49,104 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 1 case distinctions, treesize of input 26 treesize of output 26 [2019-01-14 18:53:49,109 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 0 case distinctions, treesize of input 18 treesize of output 3 [2019-01-14 18:53:49,109 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-14 18:53:49,116 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:53:49,125 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 18:53:49,125 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:66, output treesize:18 [2019-01-14 18:53:49,178 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:53:49,197 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 18:53:49,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 16 [2019-01-14 18:53:49,197 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-14 18:53:49,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-14 18:53:49,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=232, Unknown=1, NotChecked=0, Total=272 [2019-01-14 18:53:49,198 INFO L87 Difference]: Start difference. First operand 71 states and 73 transitions. Second operand 17 states. [2019-01-14 18:53:49,739 WARN L181 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 33 [2019-01-14 18:53:50,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:53:50,689 INFO L93 Difference]: Finished difference Result 72 states and 74 transitions. [2019-01-14 18:53:50,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-14 18:53:50,690 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 30 [2019-01-14 18:53:50,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:53:50,692 INFO L225 Difference]: With dead ends: 72 [2019-01-14 18:53:50,692 INFO L226 Difference]: Without dead ends: 72 [2019-01-14 18:53:50,694 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=105, Invalid=446, Unknown=1, NotChecked=0, Total=552 [2019-01-14 18:53:50,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-01-14 18:53:50,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2019-01-14 18:53:50,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-01-14 18:53:50,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 72 transitions. [2019-01-14 18:53:50,697 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 72 transitions. Word has length 30 [2019-01-14 18:53:50,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:53:50,698 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 72 transitions. [2019-01-14 18:53:50,698 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-14 18:53:50,698 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 72 transitions. [2019-01-14 18:53:50,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-14 18:53:50,701 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:53:50,701 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, 1, 1, 1, 1, 1, 1] [2019-01-14 18:53:50,703 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr28REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION]=== [2019-01-14 18:53:50,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:53:50,703 INFO L82 PathProgramCache]: Analyzing trace with hash 1321512537, now seen corresponding path program 1 times [2019-01-14 18:53:50,703 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:53:50,703 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:53:50,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:53:50,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:53:50,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:53:50,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:53:50,795 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-14 18:53:50,795 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:53:50,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 18:53:50,796 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 18:53:50,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 18:53:50,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 18:53:50,796 INFO L87 Difference]: Start difference. First operand 70 states and 72 transitions. Second operand 5 states. [2019-01-14 18:53:50,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:53:50,891 INFO L93 Difference]: Finished difference Result 69 states and 71 transitions. [2019-01-14 18:53:50,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 18:53:50,892 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-01-14 18:53:50,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:53:50,894 INFO L225 Difference]: With dead ends: 69 [2019-01-14 18:53:50,894 INFO L226 Difference]: Without dead ends: 69 [2019-01-14 18:53:50,894 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-14 18:53:50,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-01-14 18:53:50,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-01-14 18:53:50,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-01-14 18:53:50,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 71 transitions. [2019-01-14 18:53:50,899 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 71 transitions. Word has length 30 [2019-01-14 18:53:50,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:53:50,899 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 71 transitions. [2019-01-14 18:53:50,899 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 18:53:50,899 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 71 transitions. [2019-01-14 18:53:50,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-01-14 18:53:50,900 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:53:50,900 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, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:53:50,902 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr28REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION]=== [2019-01-14 18:53:50,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:53:50,902 INFO L82 PathProgramCache]: Analyzing trace with hash -1982784226, now seen corresponding path program 1 times [2019-01-14 18:53:50,902 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:53:50,902 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:53:50,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:53:50,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:53:50,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:53:50,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:53:51,131 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-14 18:53:51,132 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:53:51,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-14 18:53:51,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-14 18:53:51,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 18:53:51,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-01-14 18:53:51,133 INFO L87 Difference]: Start difference. First operand 69 states and 71 transitions. Second operand 8 states. [2019-01-14 18:53:51,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:53:51,325 INFO L93 Difference]: Finished difference Result 66 states and 68 transitions. [2019-01-14 18:53:51,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 18:53:51,328 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2019-01-14 18:53:51,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:53:51,329 INFO L225 Difference]: With dead ends: 66 [2019-01-14 18:53:51,329 INFO L226 Difference]: Without dead ends: 66 [2019-01-14 18:53:51,330 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-01-14 18:53:51,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-01-14 18:53:51,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-01-14 18:53:51,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-01-14 18:53:51,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 68 transitions. [2019-01-14 18:53:51,333 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 68 transitions. Word has length 31 [2019-01-14 18:53:51,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:53:51,334 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 68 transitions. [2019-01-14 18:53:51,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-14 18:53:51,334 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 68 transitions. [2019-01-14 18:53:51,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-01-14 18:53:51,335 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:53:51,341 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:53:51,341 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr28REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION]=== [2019-01-14 18:53:51,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:53:51,341 INFO L82 PathProgramCache]: Analyzing trace with hash -743527608, now seen corresponding path program 1 times [2019-01-14 18:53:51,342 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:53:51,342 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:53:51,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:53:51,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:53:51,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:53:51,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 18:53:51,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 18:53:51,411 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-14 18:53:51,444 WARN L416 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2019-01-14 18:53:51,464 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.01 06:53:51 BoogieIcfgContainer [2019-01-14 18:53:51,464 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-14 18:53:51,464 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 18:53:51,465 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 18:53:51,465 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 18:53:51,465 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 06:53:39" (3/4) ... [2019-01-14 18:53:51,469 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 18:53:51,470 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 18:53:51,470 INFO L168 Benchmark]: Toolchain (without parser) took 14175.40 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 273.2 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -138.1 MB). Peak memory consumption was 135.1 MB. Max. memory is 11.5 GB. [2019-01-14 18:53:51,471 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 18:53:51,472 INFO L168 Benchmark]: CACSL2BoogieTranslator took 638.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 160.4 MB). Free memory was 942.0 MB in the beginning and 1.1 GB in the end (delta: -192.7 MB). Peak memory consumption was 25.4 MB. Max. memory is 11.5 GB. [2019-01-14 18:53:51,473 INFO L168 Benchmark]: Boogie Preprocessor took 85.04 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-14 18:53:51,474 INFO L168 Benchmark]: RCFGBuilder took 1039.45 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: 51.8 MB). Peak memory consumption was 51.8 MB. Max. memory is 11.5 GB. [2019-01-14 18:53:51,475 INFO L168 Benchmark]: TraceAbstraction took 12403.31 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 112.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -2.5 MB). Peak memory consumption was 110.2 MB. Max. memory is 11.5 GB. [2019-01-14 18:53:51,476 INFO L168 Benchmark]: Witness Printer took 5.17 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 18:53:51,480 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 638.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 160.4 MB). Free memory was 942.0 MB in the beginning and 1.1 GB in the end (delta: -192.7 MB). Peak memory consumption was 25.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 85.04 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 1039.45 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: 51.8 MB). Peak memory consumption was 51.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 12403.31 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 112.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -2.5 MB). Peak memory consumption was 110.2 MB. Max. memory is 11.5 GB. * Witness Printer took 5.17 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 635]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 635. Possible FailurePath: [L620] int c = 0; VAL [\old(c)=10, c=0] [L637] struct item *list = ((void *)0); [L638] int length = 0; VAL [\old(c)=0, c=0, length=0, list={-1:0}] [L640] CALL append(&list) VAL [\old(c)=0, c=0, plist={-1:0}] [L627] c++ [L628] struct item *item = malloc(sizeof *item); VAL [\old(c)=0, c=1, item={1:0}, malloc(sizeof *item)={1:0}, plist={-1:0}, plist={-1:0}] [L629] EXPR \read(**plist) VAL [\old(c)=0, \read(**plist)={0:0}, c=1, item={1:0}, malloc(sizeof *item)={1:0}, plist={-1:0}, plist={-1:0}] [L629] item->next = *plist VAL [\old(c)=0, \read(**plist)={0:0}, c=1, item={1:0}, malloc(sizeof *item)={1:0}, plist={-1:0}, plist={-1:0}] [L630] EXPR item->next VAL [\old(c)=0, c=1, item={1:0}, item->next={0:0}, malloc(sizeof *item)={1:0}, plist={-1:0}, plist={-1:0}] [L630-L632] EXPR (item->next) ? item->next->data : malloc(sizeof *item) [L630-L632] EXPR (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={2:0}, \old(c)=0, c=1, item={1:0}, item->next={0:0}, malloc(sizeof *item)={1:0}, malloc(sizeof *item)={2:0}, plist={-1:0}, plist={-1:0}] [L630-L632] item->data = (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={2:0}, \old(c)=0, c=1, item={1:0}, item->next={0:0}, malloc(sizeof *item)={1:0}, malloc(sizeof *item)={2:0}, plist={-1:0}, plist={-1:0}] [L633] *plist = item VAL [\old(c)=0, c=1, item={1:0}, malloc(sizeof *item)={1:0}, malloc(sizeof *item)={2:0}, plist={-1:0}, plist={-1:0}] [L640] RET append(&list) VAL [\old(c)=0, c=1, length=0, list={-1:0}] [L641] length++ VAL [\old(c)=0, c=1, length=1, list={-1:0}] [L642] COND FALSE !(__VERIFIER_nondet_int() && c < 20) [L643] COND TRUE length > 0 VAL [\old(c)=0, c=1, length=1, list={-1:0}] [L644] COND FALSE !(length < 0) VAL [\old(c)=0, c=1, length=1, list={-1:0}] [L647] EXPR \read(*list) VAL [\old(c)=0, \read(*list)={1:0}, c=1, length=1, list={-1:0}] [L647] EXPR list->next VAL [\old(c)=0, \read(*list)={1:0}, c=1, length=1, list={-1:0}, list->next={0:0}] [L647] struct item *next = list->next; [L648] EXPR \read(*list) VAL [\old(c)=0, \read(*list)={1:0}, c=1, length=1, list={-1:0}, next={0:0}] [L648] free(list) VAL [\old(c)=0, \read(*list)={1:0}, c=1, length=1, list={-1:0}, next={0:0}] [L648] free(list) VAL [\old(c)=0, \read(*list)={1:0}, c=1, length=1, list={-1:0}, next={0:0}] [L648] free(list) [L649] list = next VAL [\old(c)=0, c=1, length=1, list={-1:0}, next={0:0}] [L650] length-- VAL [\old(c)=0, c=1, length=0, list={-1:0}, next={0:0}] [L652] COND FALSE !(length > 0) VAL [\old(c)=0, c=1, length=0, list={-1:0}, next={0:0}] [L658] return 0; [L637] struct item *list = ((void *)0); [L658] return 0; VAL [\old(c)=0, \result=0, c=1, length=0, next={0:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 99 locations, 44 error locations. UNSAFE Result, 12.3s OverallTime, 17 OverallIterations, 2 TraceHistogramMax, 6.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 868 SDtfs, 813 SDslu, 2338 SDs, 0 SdLazy, 2147 SolverSat, 104 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 186 GetRequests, 60 SyntacticMatches, 8 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 5.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=102occurred in iteration=1, 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, 16 MinimizatonAttempts, 64 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.9s InterpolantComputationTime, 442 NumberOfCodeBlocks, 442 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 389 ConstructedInterpolants, 11 QuantifiedInterpolants, 81202 SizeOfPredicates, 35 NumberOfNonLiveVariables, 428 ConjunctsInSsa, 90 ConjunctsInUnsatCore, 18 InterpolantComputations, 14 PerfectInterpolantSequences, 8/28 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-0ed9222-m [2019-01-14 18:53:53,663 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 18:53:53,665 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 18:53:53,682 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 18:53:53,683 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 18:53:53,684 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 18:53:53,687 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 18:53:53,689 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 18:53:53,692 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 18:53:53,694 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 18:53:53,697 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 18:53:53,697 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 18:53:53,698 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 18:53:53,700 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 18:53:53,703 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 18:53:53,704 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 18:53:53,705 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 18:53:53,709 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 18:53:53,719 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 18:53:53,721 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 18:53:53,724 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 18:53:53,725 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 18:53:53,728 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 18:53:53,728 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 18:53:53,728 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 18:53:53,729 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 18:53:53,734 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 18:53:53,737 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 18:53:53,737 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 18:53:53,738 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 18:53:53,739 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 18:53:53,739 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 18:53:53,739 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 18:53:53,739 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 18:53:53,743 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 18:53:53,743 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 18:53:53,744 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-01-14 18:53:53,774 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 18:53:53,774 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 18:53:53,775 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 18:53:53,776 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 18:53:53,779 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 18:53:53,780 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 18:53:53,780 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 18:53:53,780 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 18:53:53,780 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 18:53:53,780 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 18:53:53,781 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 18:53:53,782 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-01-14 18:53:53,782 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2019-01-14 18:53:53,782 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-01-14 18:53:53,782 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-14 18:53:53,782 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2019-01-14 18:53:53,782 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-01-14 18:53:53,783 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 18:53:53,783 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 18:53:53,783 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 18:53:53,783 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-14 18:53:53,783 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-14 18:53:53,784 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 18:53:53,787 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 18:53:53,787 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-14 18:53:53,787 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2019-01-14 18:53:53,787 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-14 18:53:53,787 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-01-14 18:53:53,787 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 -> dd0b9292151174331f3cf63e5ad3d651d29dfbcc [2019-01-14 18:53:53,843 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 18:53:53,855 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 18:53:53,862 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 18:53:53,863 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 18:53:53,864 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 18:53:53,865 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/list-ext-properties/test-0232_1_false-valid-memtrack_true-termination.i [2019-01-14 18:53:53,919 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34865e4a6/300572d1cc3b4f2bae285dc42b6de4a2/FLAG7e2b22d60 [2019-01-14 18:53:54,474 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 18:53:54,475 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/list-ext-properties/test-0232_1_false-valid-memtrack_true-termination.i [2019-01-14 18:53:54,492 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34865e4a6/300572d1cc3b4f2bae285dc42b6de4a2/FLAG7e2b22d60 [2019-01-14 18:53:54,705 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34865e4a6/300572d1cc3b4f2bae285dc42b6de4a2 [2019-01-14 18:53:54,708 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 18:53:54,709 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-01-14 18:53:54,710 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 18:53:54,710 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 18:53:54,714 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 18:53:54,715 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 06:53:54" (1/1) ... [2019-01-14 18:53:54,719 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72a0c3a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:53:54, skipping insertion in model container [2019-01-14 18:53:54,719 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 06:53:54" (1/1) ... [2019-01-14 18:53:54,727 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 18:53:54,777 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 18:53:55,138 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 18:53:55,149 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 18:53:55,303 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 18:53:55,364 INFO L195 MainTranslator]: Completed translation [2019-01-14 18:53:55,364 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:53:55 WrapperNode [2019-01-14 18:53:55,365 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 18:53:55,366 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 18:53:55,366 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 18:53:55,366 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 18:53:55,380 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:53:55" (1/1) ... [2019-01-14 18:53:55,380 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:53:55" (1/1) ... [2019-01-14 18:53:55,399 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:53:55" (1/1) ... [2019-01-14 18:53:55,399 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:53:55" (1/1) ... [2019-01-14 18:53:55,429 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:53:55" (1/1) ... [2019-01-14 18:53:55,437 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:53:55" (1/1) ... [2019-01-14 18:53:55,446 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:53:55" (1/1) ... [2019-01-14 18:53:55,457 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 18:53:55,461 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 18:53:55,461 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 18:53:55,461 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 18:53:55,462 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:53:55" (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-14 18:53:55,525 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-01-14 18:53:55,525 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 18:53:55,525 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.setCurrentRoundingMode [2019-01-14 18:53:55,526 INFO L138 BoogieDeclarations]: Found implementation of procedure append [2019-01-14 18:53:55,526 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-14 18:53:55,526 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-01-14 18:53:55,526 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-01-14 18:53:55,526 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-01-14 18:53:55,526 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-01-14 18:53:55,527 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-01-14 18:53:55,528 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-01-14 18:53:55,528 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-01-14 18:53:55,529 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-01-14 18:53:55,529 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-01-14 18:53:55,529 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-01-14 18:53:55,529 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-01-14 18:53:55,529 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-01-14 18:53:55,529 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-01-14 18:53:55,529 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-01-14 18:53:55,529 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-01-14 18:53:55,530 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-01-14 18:53:55,530 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-01-14 18:53:55,530 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-01-14 18:53:55,530 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-01-14 18:53:55,530 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-01-14 18:53:55,531 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-01-14 18:53:55,531 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-01-14 18:53:55,531 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-01-14 18:53:55,531 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-01-14 18:53:55,531 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-01-14 18:53:55,531 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-01-14 18:53:55,531 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-01-14 18:53:55,531 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-01-14 18:53:55,532 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-01-14 18:53:55,533 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-01-14 18:53:55,533 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-01-14 18:53:55,533 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-01-14 18:53:55,533 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-01-14 18:53:55,533 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-01-14 18:53:55,533 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-01-14 18:53:55,533 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-01-14 18:53:55,533 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-01-14 18:53:55,534 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-01-14 18:53:55,534 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-01-14 18:53:55,534 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-01-14 18:53:55,534 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-01-14 18:53:55,534 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-01-14 18:53:55,535 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-01-14 18:53:55,535 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-01-14 18:53:55,535 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-01-14 18:53:55,535 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-01-14 18:53:55,535 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-01-14 18:53:55,535 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-01-14 18:53:55,536 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-01-14 18:53:55,537 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-01-14 18:53:55,537 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-01-14 18:53:55,537 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-01-14 18:53:55,537 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-01-14 18:53:55,537 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-01-14 18:53:55,538 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-01-14 18:53:55,538 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-01-14 18:53:55,538 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-01-14 18:53:55,539 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-01-14 18:53:55,539 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-01-14 18:53:55,539 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-01-14 18:53:55,539 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-01-14 18:53:55,539 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-01-14 18:53:55,539 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-01-14 18:53:55,539 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-01-14 18:53:55,539 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-01-14 18:53:55,540 INFO L130 BoogieDeclarations]: Found specification of procedure __secure_getenv [2019-01-14 18:53:55,540 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-01-14 18:53:55,540 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-01-14 18:53:55,540 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-01-14 18:53:55,540 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-01-14 18:53:55,540 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-01-14 18:53:55,540 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-01-14 18:53:55,540 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-01-14 18:53:55,541 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-01-14 18:53:55,541 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-01-14 18:53:55,541 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-01-14 18:53:55,541 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-01-14 18:53:55,541 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-01-14 18:53:55,541 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-01-14 18:53:55,541 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-01-14 18:53:55,542 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-01-14 18:53:55,545 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-01-14 18:53:55,546 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-01-14 18:53:55,546 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-01-14 18:53:55,546 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-01-14 18:53:55,546 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-01-14 18:53:55,546 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-01-14 18:53:55,546 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-01-14 18:53:55,547 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-01-14 18:53:55,548 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-01-14 18:53:55,548 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-01-14 18:53:55,549 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-01-14 18:53:55,549 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-01-14 18:53:55,549 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-01-14 18:53:55,549 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-01-14 18:53:55,549 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-01-14 18:53:55,549 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-01-14 18:53:55,549 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-01-14 18:53:55,550 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-01-14 18:53:55,551 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-01-14 18:53:55,551 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-01-14 18:53:55,551 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-01-14 18:53:55,552 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-01-14 18:53:55,552 INFO L130 BoogieDeclarations]: Found specification of procedure append [2019-01-14 18:53:55,552 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-14 18:53:55,552 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-01-14 18:53:55,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-01-14 18:53:55,552 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-14 18:53:55,552 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 18:53:55,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-01-14 18:53:55,555 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 18:53:55,555 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-01-14 18:53:55,555 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 18:53:55,555 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.setCurrentRoundingMode [2019-01-14 18:53:56,688 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 18:53:56,689 INFO L286 CfgBuilder]: Removed 2 assue(true) statements. [2019-01-14 18:53:56,690 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 06:53:56 BoogieIcfgContainer [2019-01-14 18:53:56,690 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 18:53:56,693 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-14 18:53:56,693 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-14 18:53:56,696 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-14 18:53:56,697 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.01 06:53:54" (1/3) ... [2019-01-14 18:53:56,697 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58eaa467 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 06:53:56, skipping insertion in model container [2019-01-14 18:53:56,698 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:53:55" (2/3) ... [2019-01-14 18:53:56,699 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58eaa467 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 06:53:56, skipping insertion in model container [2019-01-14 18:53:56,699 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 06:53:56" (3/3) ... [2019-01-14 18:53:56,701 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0232_1_false-valid-memtrack_true-termination.i [2019-01-14 18:53:56,712 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-14 18:53:56,718 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 44 error locations. [2019-01-14 18:53:56,731 INFO L257 AbstractCegarLoop]: Starting to check reachability of 44 error locations. [2019-01-14 18:53:56,755 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 18:53:56,756 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-14 18:53:56,756 INFO L383 AbstractCegarLoop]: Hoare is false [2019-01-14 18:53:56,756 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-14 18:53:56,758 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 18:53:56,758 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 18:53:56,758 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-14 18:53:56,758 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 18:53:56,759 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-14 18:53:56,778 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states. [2019-01-14 18:53:56,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-14 18:53:56,788 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:53:56,789 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:53:56,792 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION]=== [2019-01-14 18:53:56,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:53:56,799 INFO L82 PathProgramCache]: Analyzing trace with hash -361014642, now seen corresponding path program 1 times [2019-01-14 18:53:56,804 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-14 18:53:56,804 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-14 18:53:56,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:53:56,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:53:56,915 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 18:53:56,976 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-14 18:53:56,978 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 18:53:57,009 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:53:57,010 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-01-14 18:53:57,090 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 18:53:57,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 18:53:57,119 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 19 treesize of output 23 [2019-01-14 18:53:57,120 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 18:53:57,245 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-14 18:53:57,245 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2019-01-14 18:53:57,383 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-14 18:53:57,383 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-14 18:53:57,389 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:53:57,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 18:53:57,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 18:53:57,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 18:53:57,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 18:53:57,407 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 5 states. [2019-01-14 18:53:58,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:53:58,456 INFO L93 Difference]: Finished difference Result 94 states and 98 transitions. [2019-01-14 18:53:58,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 18:53:58,459 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-01-14 18:53:58,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:53:58,469 INFO L225 Difference]: With dead ends: 94 [2019-01-14 18:53:58,469 INFO L226 Difference]: Without dead ends: 91 [2019-01-14 18:53:58,470 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-14 18:53:58,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-01-14 18:53:58,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2019-01-14 18:53:58,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-01-14 18:53:58,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 95 transitions. [2019-01-14 18:53:58,508 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 95 transitions. Word has length 9 [2019-01-14 18:53:58,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:53:58,509 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 95 transitions. [2019-01-14 18:53:58,509 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 18:53:58,509 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 95 transitions. [2019-01-14 18:53:58,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-14 18:53:58,510 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:53:58,510 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:53:58,511 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION]=== [2019-01-14 18:53:58,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:53:58,512 INFO L82 PathProgramCache]: Analyzing trace with hash -361014641, now seen corresponding path program 1 times [2019-01-14 18:53:58,512 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-14 18:53:58,512 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-14 18:53:58,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:53:58,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:53:58,593 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 18:53:58,610 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-14 18:53:58,610 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 18:53:58,624 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-14 18:53:58,624 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:53:58,639 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:53:58,640 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-01-14 18:53:58,743 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 18:53:58,747 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 18:53:58,748 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2019-01-14 18:53:58,749 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 18:53:58,776 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 18:53:58,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 18:53:58,781 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2019-01-14 18:53:58,782 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:53:58,795 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 18:53:58,796 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:14 [2019-01-14 18:53:58,821 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-14 18:53:58,821 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-14 18:53:58,823 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:53:58,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 18:53:58,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 18:53:58,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 18:53:58,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 18:53:58,825 INFO L87 Difference]: Start difference. First operand 90 states and 95 transitions. Second operand 5 states. [2019-01-14 18:53:59,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:53:59,695 INFO L93 Difference]: Finished difference Result 120 states and 125 transitions. [2019-01-14 18:53:59,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 18:53:59,696 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-01-14 18:53:59,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:53:59,700 INFO L225 Difference]: With dead ends: 120 [2019-01-14 18:53:59,701 INFO L226 Difference]: Without dead ends: 120 [2019-01-14 18:53:59,702 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-14 18:53:59,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-01-14 18:53:59,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 99. [2019-01-14 18:53:59,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-01-14 18:53:59,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 110 transitions. [2019-01-14 18:53:59,713 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 110 transitions. Word has length 9 [2019-01-14 18:53:59,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:53:59,714 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 110 transitions. [2019-01-14 18:53:59,714 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 18:53:59,715 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 110 transitions. [2019-01-14 18:53:59,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-14 18:53:59,715 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:53:59,715 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:53:59,717 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION]=== [2019-01-14 18:53:59,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:53:59,717 INFO L82 PathProgramCache]: Analyzing trace with hash 1693448065, now seen corresponding path program 1 times [2019-01-14 18:53:59,717 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-14 18:53:59,717 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-14 18:53:59,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:53:59,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:53:59,786 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 18:53:59,807 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-14 18:53:59,807 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 18:53:59,833 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:53:59,833 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-01-14 18:53:59,856 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-14 18:53:59,857 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-14 18:53:59,858 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:53:59,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 18:53:59,859 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 18:53:59,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 18:53:59,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 18:53:59,860 INFO L87 Difference]: Start difference. First operand 99 states and 110 transitions. Second operand 3 states. [2019-01-14 18:53:59,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:53:59,997 INFO L93 Difference]: Finished difference Result 95 states and 105 transitions. [2019-01-14 18:53:59,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 18:53:59,998 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-01-14 18:53:59,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:53:59,999 INFO L225 Difference]: With dead ends: 95 [2019-01-14 18:53:59,999 INFO L226 Difference]: Without dead ends: 95 [2019-01-14 18:54:00,000 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 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-14 18:54:00,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-01-14 18:54:00,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2019-01-14 18:54:00,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-01-14 18:54:00,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 105 transitions. [2019-01-14 18:54:00,011 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 105 transitions. Word has length 10 [2019-01-14 18:54:00,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:54:00,011 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 105 transitions. [2019-01-14 18:54:00,011 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 18:54:00,011 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 105 transitions. [2019-01-14 18:54:00,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-14 18:54:00,013 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:54:00,013 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:54:00,013 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION]=== [2019-01-14 18:54:00,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:54:00,014 INFO L82 PathProgramCache]: Analyzing trace with hash 1693448066, now seen corresponding path program 1 times [2019-01-14 18:54:00,014 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-14 18:54:00,014 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-14 18:54:00,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:54:00,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:54:00,103 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 18:54:00,112 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-14 18:54:00,113 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 18:54:00,165 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:54:00,166 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-01-14 18:54:00,215 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-14 18:54:00,216 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-14 18:54:00,219 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:54:00,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 18:54:00,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 18:54:00,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 18:54:00,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 18:54:00,221 INFO L87 Difference]: Start difference. First operand 95 states and 105 transitions. Second operand 3 states. [2019-01-14 18:54:00,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:54:00,360 INFO L93 Difference]: Finished difference Result 91 states and 100 transitions. [2019-01-14 18:54:00,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 18:54:00,361 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-01-14 18:54:00,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:54:00,362 INFO L225 Difference]: With dead ends: 91 [2019-01-14 18:54:00,362 INFO L226 Difference]: Without dead ends: 91 [2019-01-14 18:54:00,363 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-14 18:54:00,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-01-14 18:54:00,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-01-14 18:54:00,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-01-14 18:54:00,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 100 transitions. [2019-01-14 18:54:00,371 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 100 transitions. Word has length 10 [2019-01-14 18:54:00,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:54:00,372 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 100 transitions. [2019-01-14 18:54:00,372 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 18:54:00,372 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 100 transitions. [2019-01-14 18:54:00,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-14 18:54:00,374 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:54:00,374 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:54:00,374 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION]=== [2019-01-14 18:54:00,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:54:00,375 INFO L82 PathProgramCache]: Analyzing trace with hash -1237440327, now seen corresponding path program 1 times [2019-01-14 18:54:00,375 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-14 18:54:00,375 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-14 18:54:00,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:54:00,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:54:00,461 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 18:54:00,667 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 33 [2019-01-14 18:54:00,675 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 24 treesize of output 23 [2019-01-14 18:54:00,676 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:54:00,731 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:54:00,793 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 33 [2019-01-14 18:54:00,803 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 19 treesize of output 18 [2019-01-14 18:54:00,804 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 18:54:00,848 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 20 treesize of output 19 [2019-01-14 18:54:00,849 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-14 18:54:00,870 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:54:00,890 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 18:54:00,890 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:45, output treesize:37 [2019-01-14 18:54:01,066 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 26 treesize of output 26 [2019-01-14 18:54:01,071 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 22 treesize of output 15 [2019-01-14 18:54:01,072 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:54:01,103 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 15 treesize of output 8 [2019-01-14 18:54:01,103 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 18:54:01,134 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 0 case distinctions, treesize of input 18 treesize of output 3 [2019-01-14 18:54:01,135 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 18:54:01,143 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:54:01,188 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 26 treesize of output 26 [2019-01-14 18:54:01,193 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 22 treesize of output 15 [2019-01-14 18:54:01,194 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-14 18:54:01,222 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 15 treesize of output 8 [2019-01-14 18:54:01,222 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-14 18:54:01,247 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 0 case distinctions, treesize of input 18 treesize of output 3 [2019-01-14 18:54:01,248 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-14 18:54:01,260 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:54:01,266 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:54:01,267 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:51, output treesize:7 [2019-01-14 18:54:01,286 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-14 18:54:01,286 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-14 18:54:01,290 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:54:01,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-14 18:54:01,291 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-14 18:54:01,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 18:54:01,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=39, Unknown=4, NotChecked=0, Total=56 [2019-01-14 18:54:01,291 INFO L87 Difference]: Start difference. First operand 91 states and 100 transitions. Second operand 8 states. [2019-01-14 18:54:02,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:54:02,224 INFO L93 Difference]: Finished difference Result 99 states and 109 transitions. [2019-01-14 18:54:02,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-14 18:54:02,224 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2019-01-14 18:54:02,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:54:02,226 INFO L225 Difference]: With dead ends: 99 [2019-01-14 18:54:02,226 INFO L226 Difference]: Without dead ends: 99 [2019-01-14 18:54:02,227 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=46, Invalid=98, Unknown=12, NotChecked=0, Total=156 [2019-01-14 18:54:02,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-01-14 18:54:02,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2019-01-14 18:54:02,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-01-14 18:54:02,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 108 transitions. [2019-01-14 18:54:02,237 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 108 transitions. Word has length 15 [2019-01-14 18:54:02,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:54:02,237 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 108 transitions. [2019-01-14 18:54:02,237 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-14 18:54:02,237 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 108 transitions. [2019-01-14 18:54:02,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-14 18:54:02,238 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:54:02,238 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:54:02,238 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION]=== [2019-01-14 18:54:02,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:54:02,241 INFO L82 PathProgramCache]: Analyzing trace with hash 294333670, now seen corresponding path program 1 times [2019-01-14 18:54:02,241 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-14 18:54:02,241 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-14 18:54:02,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:54:02,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:54:02,349 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 18:54:02,584 WARN L181 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 14 [2019-01-14 18:54:02,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 18:54:02,641 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 14 treesize of output 17 [2019-01-14 18:54:02,642 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 18:54:02,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 18:54:02,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 18:54:02,697 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-01-14 18:54:02,698 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:54:02,710 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 18:54:02,711 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:20 [2019-01-14 18:54:02,741 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-14 18:54:02,742 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-14 18:54:02,744 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:54:02,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-14 18:54:02,745 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 18:54:02,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 18:54:02,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-14 18:54:02,745 INFO L87 Difference]: Start difference. First operand 98 states and 108 transitions. Second operand 7 states. [2019-01-14 18:54:03,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:54:03,233 INFO L93 Difference]: Finished difference Result 99 states and 109 transitions. [2019-01-14 18:54:03,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 18:54:03,235 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2019-01-14 18:54:03,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:54:03,237 INFO L225 Difference]: With dead ends: 99 [2019-01-14 18:54:03,237 INFO L226 Difference]: Without dead ends: 99 [2019-01-14 18:54:03,237 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-01-14 18:54:03,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-01-14 18:54:03,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2019-01-14 18:54:03,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-01-14 18:54:03,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 109 transitions. [2019-01-14 18:54:03,249 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 109 transitions. Word has length 16 [2019-01-14 18:54:03,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:54:03,249 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 109 transitions. [2019-01-14 18:54:03,249 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 18:54:03,249 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 109 transitions. [2019-01-14 18:54:03,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-14 18:54:03,253 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:54:03,253 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-14 18:54:03,254 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION]=== [2019-01-14 18:54:03,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:54:03,254 INFO L82 PathProgramCache]: Analyzing trace with hash -212963565, now seen corresponding path program 1 times [2019-01-14 18:54:03,254 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-14 18:54:03,255 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-14 18:54:03,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:54:03,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:54:03,365 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 18:54:03,386 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-14 18:54:03,386 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-14 18:54:03,390 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:54:03,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 18:54:03,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 18:54:03,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 18:54:03,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 18:54:03,392 INFO L87 Difference]: Start difference. First operand 99 states and 109 transitions. Second operand 4 states. [2019-01-14 18:54:03,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:54:03,458 INFO L93 Difference]: Finished difference Result 125 states and 137 transitions. [2019-01-14 18:54:03,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 18:54:03,459 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-01-14 18:54:03,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:54:03,461 INFO L225 Difference]: With dead ends: 125 [2019-01-14 18:54:03,461 INFO L226 Difference]: Without dead ends: 125 [2019-01-14 18:54:03,462 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 18:54:03,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-01-14 18:54:03,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 113. [2019-01-14 18:54:03,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-01-14 18:54:03,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 131 transitions. [2019-01-14 18:54:03,470 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 131 transitions. Word has length 24 [2019-01-14 18:54:03,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:54:03,470 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 131 transitions. [2019-01-14 18:54:03,470 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 18:54:03,471 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 131 transitions. [2019-01-14 18:54:03,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-14 18:54:03,472 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:54:03,472 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-14 18:54:03,473 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION]=== [2019-01-14 18:54:03,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:54:03,473 INFO L82 PathProgramCache]: Analyzing trace with hash -214185761, now seen corresponding path program 1 times [2019-01-14 18:54:03,473 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-14 18:54:03,474 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-14 18:54:03,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:54:03,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:54:03,582 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 18:54:03,633 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 5 treesize of output 1 [2019-01-14 18:54:03,634 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 18:54:03,642 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:54:03,642 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:7 [2019-01-14 18:54:03,667 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 11 treesize of output 8 [2019-01-14 18:54:03,670 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 8 treesize of output 7 [2019-01-14 18:54:03,670 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:54:03,674 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:54:03,695 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-14 18:54:03,695 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2019-01-14 18:54:03,733 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 19 treesize of output 15 [2019-01-14 18:54:03,735 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 15 treesize of output 7 [2019-01-14 18:54:03,736 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:54:03,738 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:54:03,740 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-14 18:54:03,740 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:7 [2019-01-14 18:54:03,753 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-14 18:54:03,754 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-14 18:54:03,756 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:54:03,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-14 18:54:03,756 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-14 18:54:03,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 18:54:03,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-01-14 18:54:03,757 INFO L87 Difference]: Start difference. First operand 113 states and 131 transitions. Second operand 8 states. [2019-01-14 18:54:04,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:54:04,438 INFO L93 Difference]: Finished difference Result 129 states and 142 transitions. [2019-01-14 18:54:04,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-14 18:54:04,438 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2019-01-14 18:54:04,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:54:04,439 INFO L225 Difference]: With dead ends: 129 [2019-01-14 18:54:04,440 INFO L226 Difference]: Without dead ends: 129 [2019-01-14 18:54:04,440 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-01-14 18:54:04,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-01-14 18:54:04,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 113. [2019-01-14 18:54:04,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-01-14 18:54:04,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 129 transitions. [2019-01-14 18:54:04,446 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 129 transitions. Word has length 24 [2019-01-14 18:54:04,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:54:04,447 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 129 transitions. [2019-01-14 18:54:04,448 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-14 18:54:04,448 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 129 transitions. [2019-01-14 18:54:04,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-14 18:54:04,448 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:54:04,449 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-14 18:54:04,449 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION]=== [2019-01-14 18:54:04,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:54:04,449 INFO L82 PathProgramCache]: Analyzing trace with hash -214185760, now seen corresponding path program 1 times [2019-01-14 18:54:04,450 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-14 18:54:04,452 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-14 18:54:04,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:54:04,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:54:04,574 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 18:54:04,636 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 11 treesize of output 8 [2019-01-14 18:54:04,640 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 8 treesize of output 7 [2019-01-14 18:54:04,640 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:54:04,645 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:54:04,668 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 11 treesize of output 8 [2019-01-14 18:54:04,675 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 8 treesize of output 7 [2019-01-14 18:54:04,675 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 18:54:04,680 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:54:04,692 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:54:04,693 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:28, output treesize:17 [2019-01-14 18:54:04,748 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 15 treesize of output 11 [2019-01-14 18:54:04,752 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 3 [2019-01-14 18:54:04,753 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:54:04,756 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:54:04,773 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-14 18:54:04,776 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-14 18:54:04,776 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 18:54:04,779 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:54:04,786 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:54:04,786 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:31, output treesize:9 [2019-01-14 18:54:04,810 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-14 18:54:04,810 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-14 18:54:04,812 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:54:04,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-14 18:54:04,813 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-14 18:54:04,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 18:54:04,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-01-14 18:54:04,813 INFO L87 Difference]: Start difference. First operand 113 states and 129 transitions. Second operand 8 states. [2019-01-14 18:54:05,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:54:05,448 INFO L93 Difference]: Finished difference Result 124 states and 136 transitions. [2019-01-14 18:54:05,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 18:54:05,449 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2019-01-14 18:54:05,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:54:05,450 INFO L225 Difference]: With dead ends: 124 [2019-01-14 18:54:05,451 INFO L226 Difference]: Without dead ends: 124 [2019-01-14 18:54:05,451 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-01-14 18:54:05,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-01-14 18:54:05,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 112. [2019-01-14 18:54:05,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-01-14 18:54:05,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 126 transitions. [2019-01-14 18:54:05,456 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 126 transitions. Word has length 24 [2019-01-14 18:54:05,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:54:05,456 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 126 transitions. [2019-01-14 18:54:05,456 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-14 18:54:05,457 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 126 transitions. [2019-01-14 18:54:05,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-14 18:54:05,457 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:54:05,457 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, 1, 1, 1] [2019-01-14 18:54:05,460 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION]=== [2019-01-14 18:54:05,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:54:05,460 INFO L82 PathProgramCache]: Analyzing trace with hash 1513416792, now seen corresponding path program 1 times [2019-01-14 18:54:05,460 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-14 18:54:05,460 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-14 18:54:05,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:54:05,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:54:05,589 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 18:54:05,625 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 11 treesize of output 8 [2019-01-14 18:54:05,627 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 8 treesize of output 7 [2019-01-14 18:54:05,627 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:54:05,631 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:54:05,633 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:54:05,634 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2019-01-14 18:54:05,662 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 15 treesize of output 11 [2019-01-14 18:54:05,666 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 3 [2019-01-14 18:54:05,667 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:54:05,668 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:54:05,671 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-14 18:54:05,671 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-01-14 18:54:05,683 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-14 18:54:05,683 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-14 18:54:05,685 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:54:05,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-14 18:54:05,685 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 18:54:05,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 18:54:05,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-14 18:54:05,686 INFO L87 Difference]: Start difference. First operand 112 states and 126 transitions. Second operand 7 states. [2019-01-14 18:54:06,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:54:06,031 INFO L93 Difference]: Finished difference Result 123 states and 134 transitions. [2019-01-14 18:54:06,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 18:54:06,032 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2019-01-14 18:54:06,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:54:06,033 INFO L225 Difference]: With dead ends: 123 [2019-01-14 18:54:06,033 INFO L226 Difference]: Without dead ends: 123 [2019-01-14 18:54:06,034 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-01-14 18:54:06,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-01-14 18:54:06,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 111. [2019-01-14 18:54:06,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-01-14 18:54:06,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 124 transitions. [2019-01-14 18:54:06,038 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 124 transitions. Word has length 27 [2019-01-14 18:54:06,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:54:06,038 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 124 transitions. [2019-01-14 18:54:06,038 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 18:54:06,039 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 124 transitions. [2019-01-14 18:54:06,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-01-14 18:54:06,040 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:54:06,041 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, 1, 1, 1, 1] [2019-01-14 18:54:06,042 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION]=== [2019-01-14 18:54:06,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:54:06,042 INFO L82 PathProgramCache]: Analyzing trace with hash -328719616, now seen corresponding path program 1 times [2019-01-14 18:54:06,043 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-14 18:54:06,044 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-14 18:54:06,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:54:06,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:54:06,183 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 18:54:06,224 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 11 treesize of output 8 [2019-01-14 18:54:06,226 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 8 treesize of output 7 [2019-01-14 18:54:06,227 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:54:06,229 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:54:06,238 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-14 18:54:06,239 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:7 [2019-01-14 18:54:06,288 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 15 treesize of output 11 [2019-01-14 18:54:06,292 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 3 [2019-01-14 18:54:06,293 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:54:06,302 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:54:06,304 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-14 18:54:06,304 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-01-14 18:54:06,319 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-14 18:54:06,320 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-14 18:54:06,321 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:54:06,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-14 18:54:06,322 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 18:54:06,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 18:54:06,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-14 18:54:06,323 INFO L87 Difference]: Start difference. First operand 111 states and 124 transitions. Second operand 7 states. [2019-01-14 18:54:06,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:54:06,841 INFO L93 Difference]: Finished difference Result 122 states and 132 transitions. [2019-01-14 18:54:06,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 18:54:06,842 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2019-01-14 18:54:06,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:54:06,843 INFO L225 Difference]: With dead ends: 122 [2019-01-14 18:54:06,843 INFO L226 Difference]: Without dead ends: 122 [2019-01-14 18:54:06,844 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-01-14 18:54:06,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-01-14 18:54:06,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 110. [2019-01-14 18:54:06,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-01-14 18:54:06,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 122 transitions. [2019-01-14 18:54:06,849 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 122 transitions. Word has length 28 [2019-01-14 18:54:06,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:54:06,849 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 122 transitions. [2019-01-14 18:54:06,850 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 18:54:06,850 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 122 transitions. [2019-01-14 18:54:06,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-01-14 18:54:06,851 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:54:06,852 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:54:06,853 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION]=== [2019-01-14 18:54:06,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:54:06,853 INFO L82 PathProgramCache]: Analyzing trace with hash 30416938, now seen corresponding path program 1 times [2019-01-14 18:54:06,854 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-14 18:54:06,854 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-14 18:54:06,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:54:07,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:54:07,017 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 18:54:07,041 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 5 treesize of output 1 [2019-01-14 18:54:07,041 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 18:54:07,048 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:54:07,049 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:7 [2019-01-14 18:54:07,079 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 11 treesize of output 8 [2019-01-14 18:54:07,083 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 8 treesize of output 7 [2019-01-14 18:54:07,084 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:54:07,091 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:54:07,097 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-14 18:54:07,098 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2019-01-14 18:54:07,156 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 18 treesize of output 15 [2019-01-14 18:54:07,157 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 18:54:07,167 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:54:07,167 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:18 [2019-01-14 18:54:07,405 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 35 [2019-01-14 18:54:07,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 28 treesize of output 27 [2019-01-14 18:54:07,421 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:54:07,458 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:54:07,470 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-14 18:54:07,470 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:28 [2019-01-14 18:54:07,557 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 30 treesize of output 30 [2019-01-14 18:54:07,565 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 26 treesize of output 19 [2019-01-14 18:54:07,566 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:54:07,596 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 0 case distinctions, treesize of input 22 treesize of output 7 [2019-01-14 18:54:07,596 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 18:54:07,605 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:54:07,611 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 18:54:07,612 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:35, output treesize:13 [2019-01-14 18:54:07,640 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:54:07,640 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-14 18:54:07,996 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 11 treesize of output 9 [2019-01-14 18:54:08,000 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 7 [2019-01-14 18:54:08,000 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-14 18:54:08,003 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-14 18:54:08,034 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2019-01-14 18:54:08,034 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:50 [2019-01-14 18:54:08,137 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 15 treesize of output 10 [2019-01-14 18:54:08,138 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 18:54:08,173 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 15 treesize of output 10 [2019-01-14 18:54:08,174 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:54:08,191 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 18:54:08,192 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:31, output treesize:7 [2019-01-14 18:54:08,196 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 10 treesize of output 3 [2019-01-14 18:54:08,196 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 18:54:08,200 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 3 [2019-01-14 18:54:08,200 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:54:08,206 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 18:54:08,207 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:7 [2019-01-14 18:54:08,212 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:54:08,214 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 18:54:08,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 16 [2019-01-14 18:54:08,215 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-14 18:54:08,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-14 18:54:08,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2019-01-14 18:54:08,215 INFO L87 Difference]: Start difference. First operand 110 states and 122 transitions. Second operand 17 states. [2019-01-14 18:54:09,451 WARN L181 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 31 [2019-01-14 18:54:10,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:54:10,912 INFO L93 Difference]: Finished difference Result 127 states and 136 transitions. [2019-01-14 18:54:10,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-14 18:54:10,914 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 29 [2019-01-14 18:54:10,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:54:10,916 INFO L225 Difference]: With dead ends: 127 [2019-01-14 18:54:10,916 INFO L226 Difference]: Without dead ends: 127 [2019-01-14 18:54:10,917 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=145, Invalid=505, Unknown=0, NotChecked=0, Total=650 [2019-01-14 18:54:10,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-01-14 18:54:10,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 109. [2019-01-14 18:54:10,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-01-14 18:54:10,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 120 transitions. [2019-01-14 18:54:10,922 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 120 transitions. Word has length 29 [2019-01-14 18:54:10,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:54:10,922 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 120 transitions. [2019-01-14 18:54:10,922 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-14 18:54:10,922 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 120 transitions. [2019-01-14 18:54:10,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-01-14 18:54:10,924 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:54:10,924 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:54:10,925 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION]=== [2019-01-14 18:54:10,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:54:10,927 INFO L82 PathProgramCache]: Analyzing trace with hash 30416939, now seen corresponding path program 1 times [2019-01-14 18:54:10,927 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-14 18:54:10,927 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-14 18:54:10,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:54:11,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:54:11,117 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 18:54:11,132 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-14 18:54:11,132 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 18:54:11,155 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-14 18:54:11,155 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:54:11,171 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:54:11,171 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:20 [2019-01-14 18:54:11,200 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 18:54:11,201 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-14 18:54:11,201 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 18:54:11,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 18:54:11,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 18:54:11,290 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-01-14 18:54:11,291 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:54:11,419 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 18:54:11,420 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:24 [2019-01-14 18:54:11,537 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 11 treesize of output 8 [2019-01-14 18:54:11,551 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 8 treesize of output 7 [2019-01-14 18:54:11,552 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:54:11,577 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:54:11,777 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 11 treesize of output 8 [2019-01-14 18:54:11,793 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-14 18:54:11,794 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 18:54:11,823 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:54:11,983 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 18:54:11,984 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:42, output treesize:41 [2019-01-14 18:54:12,196 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2019-01-14 18:54:12,375 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 18:54:12,379 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 21 treesize of output 36 [2019-01-14 18:54:12,380 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 18:54:12,425 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 18:54:12,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 18:54:12,427 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2019-01-14 18:54:12,428 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:54:12,451 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-14 18:54:12,451 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:53, output treesize:46 [2019-01-14 18:54:12,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, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 33 [2019-01-14 18:54:12,618 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 19 treesize of output 18 [2019-01-14 18:54:12,619 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:54:12,670 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 20 treesize of output 19 [2019-01-14 18:54:12,671 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 18:54:12,694 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:54:12,856 INFO L303 Elim1Store]: Index analysis took 137 ms [2019-01-14 18:54:12,987 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 41 [2019-01-14 18:54:12,993 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33 [2019-01-14 18:54:12,994 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-14 18:54:13,069 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:54:13,090 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-14 18:54:13,091 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:62, output treesize:54 [2019-01-14 18:54:13,230 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 26 treesize of output 26 [2019-01-14 18:54:13,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 15 [2019-01-14 18:54:13,235 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:54:13,271 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 0 case distinctions, treesize of input 18 treesize of output 3 [2019-01-14 18:54:13,272 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 18:54:13,284 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:54:13,359 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 36 treesize of output 34 [2019-01-14 18:54:13,364 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 30 treesize of output 23 [2019-01-14 18:54:13,364 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-14 18:54:13,417 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 23 treesize of output 14 [2019-01-14 18:54:13,417 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-14 18:54:13,453 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2019-01-14 18:54:13,453 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-14 18:54:13,468 INFO L267 ElimStorePlain]: Start of recursive call 5: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:54:13,481 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 18:54:13,482 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:68, output treesize:20 [2019-01-14 18:54:13,533 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:54:13,534 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-14 18:54:15,250 WARN L181 SmtUtils]: Spent 426.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2019-01-14 18:54:15,262 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-14 18:54:15,265 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-01-14 18:54:15,282 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:54:15,325 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:54:15,333 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 25 treesize of output 21 [2019-01-14 18:54:15,336 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 11 treesize of output 7 [2019-01-14 18:54:15,339 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 18:54:15,345 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:54:15,353 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 29 treesize of output 25 [2019-01-14 18:54:15,359 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 11 treesize of output 7 [2019-01-14 18:54:15,361 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-14 18:54:15,370 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:54:15,588 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 19 treesize of output 17 [2019-01-14 18:54:15,592 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-14 18:54:15,593 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-14 18:54:15,599 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:54:15,603 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 19 treesize of output 17 [2019-01-14 18:54:15,607 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2019-01-14 18:54:15,609 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-14 18:54:15,619 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:54:15,793 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 28 treesize of output 26 [2019-01-14 18:54:15,797 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2019-01-14 18:54:15,797 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 18:54:15,814 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 18:54:15,818 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 28 treesize of output 26 [2019-01-14 18:54:15,821 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 16 treesize of output 14 [2019-01-14 18:54:15,822 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 18:54:15,844 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 18:54:16,010 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 24 treesize of output 22 [2019-01-14 18:54:16,015 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 12 treesize of output 10 [2019-01-14 18:54:16,016 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 18:54:16,035 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 18:54:16,041 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 24 treesize of output 22 [2019-01-14 18:54:16,045 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2019-01-14 18:54:16,046 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 18:54:16,063 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 18:54:16,253 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 4 dim-2 vars, End of recursive call: 13 dim-0 vars, and 9 xjuncts. [2019-01-14 18:54:16,253 INFO L202 ElimStorePlain]: Needed 19 recursive calls to eliminate 7 variables, input treesize:104, output treesize:132 [2019-01-14 18:54:16,713 WARN L181 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 59 [2019-01-14 18:54:16,735 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 18:54:16,736 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 18:54:16,737 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 17 [2019-01-14 18:54:16,738 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 18:54:16,858 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 18:54:16,859 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 18:54:16,860 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 14 [2019-01-14 18:54:16,860 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:54:16,982 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 18:54:16,983 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 18:54:16,984 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 11 [2019-01-14 18:54:16,984 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 18:54:17,104 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 18:54:17,106 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 18:54:17,107 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2019-01-14 18:54:17,107 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 18:54:17,210 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 18:54:17,212 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 18:54:17,213 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 7 [2019-01-14 18:54:17,214 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-14 18:54:17,320 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 5 dim-1 vars, End of recursive call: 4 dim-0 vars, and 5 xjuncts. [2019-01-14 18:54:17,321 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 12 variables, input treesize:104, output treesize:47 [2019-01-14 18:54:17,695 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 24 [2019-01-14 18:54:18,040 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:54:18,045 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 18:54:18,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 20 [2019-01-14 18:54:18,045 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-01-14 18:54:18,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-01-14 18:54:18,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2019-01-14 18:54:18,047 INFO L87 Difference]: Start difference. First operand 109 states and 120 transitions. Second operand 21 states. [2019-01-14 18:54:19,154 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 49 [2019-01-14 18:54:19,528 WARN L181 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 50 [2019-01-14 18:54:19,738 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 44 [2019-01-14 18:54:20,114 WARN L181 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 50 [2019-01-14 18:54:25,826 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 51 [2019-01-14 18:54:30,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:54:30,409 INFO L93 Difference]: Finished difference Result 129 states and 138 transitions. [2019-01-14 18:54:30,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-14 18:54:30,410 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 29 [2019-01-14 18:54:30,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:54:30,411 INFO L225 Difference]: With dead ends: 129 [2019-01-14 18:54:30,411 INFO L226 Difference]: Without dead ends: 129 [2019-01-14 18:54:30,412 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=159, Invalid=653, Unknown=0, NotChecked=0, Total=812 [2019-01-14 18:54:30,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-01-14 18:54:30,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 108. [2019-01-14 18:54:30,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-01-14 18:54:30,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 119 transitions. [2019-01-14 18:54:30,417 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 119 transitions. Word has length 29 [2019-01-14 18:54:30,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:54:30,419 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 119 transitions. [2019-01-14 18:54:30,419 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-01-14 18:54:30,419 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 119 transitions. [2019-01-14 18:54:30,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-01-14 18:54:30,422 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:54:30,422 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, 1, 1, 1, 1, 1] [2019-01-14 18:54:30,422 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION]=== [2019-01-14 18:54:30,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:54:30,423 INFO L82 PathProgramCache]: Analyzing trace with hash -1600373414, now seen corresponding path program 1 times [2019-01-14 18:54:30,423 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-14 18:54:30,423 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-14 18:54:30,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:54:30,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:54:30,546 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 18:54:30,592 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 5 treesize of output 1 [2019-01-14 18:54:30,593 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 18:54:30,599 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:54:30,599 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:7 [2019-01-14 18:54:30,624 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 11 treesize of output 8 [2019-01-14 18:54:30,627 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 8 treesize of output 7 [2019-01-14 18:54:30,627 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:54:30,634 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:54:30,640 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-14 18:54:30,641 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2019-01-14 18:54:30,671 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 19 treesize of output 15 [2019-01-14 18:54:30,673 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 15 treesize of output 7 [2019-01-14 18:54:30,674 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:54:30,675 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:54:30,677 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-14 18:54:30,677 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:7 [2019-01-14 18:54:30,688 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-14 18:54:30,688 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-14 18:54:30,690 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:54:30,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-14 18:54:30,691 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-14 18:54:30,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 18:54:30,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-01-14 18:54:30,691 INFO L87 Difference]: Start difference. First operand 108 states and 119 transitions. Second operand 8 states. [2019-01-14 18:54:31,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:54:31,175 INFO L93 Difference]: Finished difference Result 120 states and 128 transitions. [2019-01-14 18:54:31,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 18:54:31,182 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2019-01-14 18:54:31,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:54:31,183 INFO L225 Difference]: With dead ends: 120 [2019-01-14 18:54:31,183 INFO L226 Difference]: Without dead ends: 120 [2019-01-14 18:54:31,183 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-01-14 18:54:31,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-01-14 18:54:31,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 111. [2019-01-14 18:54:31,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-01-14 18:54:31,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 121 transitions. [2019-01-14 18:54:31,190 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 121 transitions. Word has length 29 [2019-01-14 18:54:31,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:54:31,190 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 121 transitions. [2019-01-14 18:54:31,190 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-14 18:54:31,191 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 121 transitions. [2019-01-14 18:54:31,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-14 18:54:31,193 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:54:31,194 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, 1, 1, 1, 1, 1, 1] [2019-01-14 18:54:31,195 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION]=== [2019-01-14 18:54:31,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:54:31,195 INFO L82 PathProgramCache]: Analyzing trace with hash 1928031811, now seen corresponding path program 1 times [2019-01-14 18:54:31,198 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-14 18:54:31,198 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-14 18:54:31,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:54:31,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:54:31,343 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 18:54:31,346 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-14 18:54:31,346 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 18:54:31,355 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:54:31,356 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-01-14 18:54:31,400 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 5 treesize of output 1 [2019-01-14 18:54:31,400 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 18:54:31,409 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:54:31,409 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:12 [2019-01-14 18:54:31,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2019-01-14 18:54:31,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 8 treesize of output 7 [2019-01-14 18:54:31,419 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:54:31,422 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:54:31,432 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-14 18:54:31,432 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:17 [2019-01-14 18:54:31,449 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 18:54:31,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 18:54:31,451 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2019-01-14 18:54:31,452 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 18:54:31,459 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:54:31,459 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2019-01-14 18:54:31,484 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 16 treesize of output 12 [2019-01-14 18:54:31,486 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 12 treesize of output 4 [2019-01-14 18:54:31,486 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:54:31,488 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:54:31,492 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:54:31,492 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:10 [2019-01-14 18:54:31,511 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 18:54:31,512 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2019-01-14 18:54:31,512 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 18:54:31,518 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-14 18:54:31,519 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:11 [2019-01-14 18:54:31,540 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-14 18:54:31,541 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-14 18:54:31,543 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:54:31,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-14 18:54:31,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-14 18:54:31,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-14 18:54:31,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-01-14 18:54:31,544 INFO L87 Difference]: Start difference. First operand 111 states and 121 transitions. Second operand 9 states. [2019-01-14 18:54:36,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:54:36,457 INFO L93 Difference]: Finished difference Result 139 states and 147 transitions. [2019-01-14 18:54:36,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-14 18:54:36,459 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2019-01-14 18:54:36,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:54:36,461 INFO L225 Difference]: With dead ends: 139 [2019-01-14 18:54:36,461 INFO L226 Difference]: Without dead ends: 139 [2019-01-14 18:54:36,462 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-01-14 18:54:36,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-01-14 18:54:36,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 112. [2019-01-14 18:54:36,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-01-14 18:54:36,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 122 transitions. [2019-01-14 18:54:36,468 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 122 transitions. Word has length 30 [2019-01-14 18:54:36,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:54:36,468 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 122 transitions. [2019-01-14 18:54:36,468 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-14 18:54:36,468 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 122 transitions. [2019-01-14 18:54:36,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-14 18:54:36,469 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:54:36,469 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, 1, 1, 1, 1, 1, 1] [2019-01-14 18:54:36,470 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION]=== [2019-01-14 18:54:36,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:54:36,475 INFO L82 PathProgramCache]: Analyzing trace with hash 1928031812, now seen corresponding path program 1 times [2019-01-14 18:54:36,476 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-14 18:54:36,476 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-14 18:54:36,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:54:36,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:54:36,556 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 18:54:36,600 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-14 18:54:36,600 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-14 18:54:36,608 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:54:36,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 18:54:36,608 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 18:54:36,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 18:54:36,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 18:54:36,609 INFO L87 Difference]: Start difference. First operand 112 states and 122 transitions. Second operand 3 states. [2019-01-14 18:54:36,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:54:36,770 INFO L93 Difference]: Finished difference Result 107 states and 115 transitions. [2019-01-14 18:54:36,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 18:54:36,771 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-01-14 18:54:36,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:54:36,772 INFO L225 Difference]: With dead ends: 107 [2019-01-14 18:54:36,772 INFO L226 Difference]: Without dead ends: 107 [2019-01-14 18:54:36,773 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 28 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-14 18:54:36,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-01-14 18:54:36,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 101. [2019-01-14 18:54:36,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-01-14 18:54:36,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 106 transitions. [2019-01-14 18:54:36,778 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 106 transitions. Word has length 30 [2019-01-14 18:54:36,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:54:36,778 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 106 transitions. [2019-01-14 18:54:36,778 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 18:54:36,778 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 106 transitions. [2019-01-14 18:54:36,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-01-14 18:54:36,779 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:54:36,779 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:54:36,779 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION]=== [2019-01-14 18:54:36,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:54:36,780 INFO L82 PathProgramCache]: Analyzing trace with hash 390378349, now seen corresponding path program 1 times [2019-01-14 18:54:36,780 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-14 18:54:36,780 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-14 18:54:36,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:54:36,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 18:54:37,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 18:54:37,206 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-14 18:54:37,209 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-14 18:54:37,232 WARN L416 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2019-01-14 18:54:37,256 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.01 06:54:37 BoogieIcfgContainer [2019-01-14 18:54:37,256 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-14 18:54:37,257 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 18:54:37,257 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 18:54:37,257 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 18:54:37,257 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 06:53:56" (3/4) ... [2019-01-14 18:54:37,263 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 18:54:37,263 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 18:54:37,264 INFO L168 Benchmark]: Toolchain (without parser) took 42555.68 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 309.3 MB). Free memory was 946.0 MB in the beginning and 922.5 MB in the end (delta: 23.5 MB). Peak memory consumption was 332.8 MB. Max. memory is 11.5 GB. [2019-01-14 18:54:37,264 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 18:54:37,265 INFO L168 Benchmark]: CACSL2BoogieTranslator took 655.20 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 150.5 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -184.9 MB). Peak memory consumption was 30.2 MB. Max. memory is 11.5 GB. [2019-01-14 18:54:37,265 INFO L168 Benchmark]: Boogie Preprocessor took 94.99 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.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-01-14 18:54:37,269 INFO L168 Benchmark]: RCFGBuilder took 1229.34 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 50.4 MB). Peak memory consumption was 50.4 MB. Max. memory is 11.5 GB. [2019-01-14 18:54:37,270 INFO L168 Benchmark]: TraceAbstraction took 40563.60 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 158.9 MB). Free memory was 1.1 GB in the beginning and 922.5 MB in the end (delta: 151.4 MB). Peak memory consumption was 310.3 MB. Max. memory is 11.5 GB. [2019-01-14 18:54:37,271 INFO L168 Benchmark]: Witness Printer took 6.53 ms. Allocated memory is still 1.3 GB. Free memory is still 922.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 18:54:37,277 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 655.20 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 150.5 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -184.9 MB). Peak memory consumption was 30.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 94.99 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.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1229.34 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 50.4 MB). Peak memory consumption was 50.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 40563.60 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 158.9 MB). Free memory was 1.1 GB in the beginning and 922.5 MB in the end (delta: 151.4 MB). Peak memory consumption was 310.3 MB. Max. memory is 11.5 GB. * Witness Printer took 6.53 ms. Allocated memory is still 1.3 GB. Free memory is still 922.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 635]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 635. Possible FailurePath: [L620] int c = 0; VAL [\old(c)=0, c=0] [L637] struct item *list = ((void *)0); [L638] int length = 0; VAL [\old(c)=0, c=0, length=0, list={-2147483647:0}] [L640] CALL append(&list) VAL [\old(c)=0, c=0, plist={-2147483647:0}] [L627] c++ [L628] struct item *item = malloc(sizeof *item); VAL [\old(c)=0, c=1, item={-1216889031:0}, malloc(sizeof *item)={-1216889031:0}, plist={-2147483647:0}, plist={-2147483647:0}] [L629] EXPR \read(**plist) VAL [\old(c)=0, \read(**plist)={0:0}, c=1, item={-1216889031:0}, malloc(sizeof *item)={-1216889031:0}, plist={-2147483647:0}, plist={-2147483647:0}] [L629] item->next = *plist VAL [\old(c)=0, \read(**plist)={0:0}, c=1, item={-1216889031:0}, malloc(sizeof *item)={-1216889031:0}, plist={-2147483647:0}, plist={-2147483647:0}] [L630] EXPR item->next VAL [\old(c)=0, c=1, item={-1216889031:0}, item->next={0:0}, malloc(sizeof *item)={-1216889031:0}, plist={-2147483647:0}, plist={-2147483647:0}] [L630-L632] EXPR (item->next) ? item->next->data : malloc(sizeof *item) [L630-L632] EXPR (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={-2113929216:0}, \old(c)=0, c=1, item={-1216889031:0}, item->next={0:0}, malloc(sizeof *item)={-2113929216:0}, malloc(sizeof *item)={-1216889031:0}, plist={-2147483647:0}, plist={-2147483647:0}] [L630-L632] item->data = (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={-2113929216:0}, \old(c)=0, c=1, item={-1216889031:0}, item->next={0:0}, malloc(sizeof *item)={-2113929216:0}, malloc(sizeof *item)={-1216889031:0}, plist={-2147483647:0}, plist={-2147483647:0}] [L633] *plist = item VAL [\old(c)=0, c=1, item={-1216889031:0}, malloc(sizeof *item)={-2113929216:0}, malloc(sizeof *item)={-1216889031:0}, plist={-2147483647:0}, plist={-2147483647:0}] [L640] RET append(&list) VAL [\old(c)=0, c=1, length=0, list={-2147483647:0}] [L641] length++ VAL [\old(c)=0, c=1, length=1, list={-2147483647:0}] [L642] COND FALSE !(__VERIFIER_nondet_int() && c < 20) [L643] COND TRUE length > 0 VAL [\old(c)=0, c=1, length=1, list={-2147483647:0}] [L644] COND FALSE !(length < 0) VAL [\old(c)=0, c=1, length=1, list={-2147483647:0}] [L647] EXPR \read(*list) VAL [\old(c)=0, \read(*list)={-1216889031:0}, c=1, length=1, list={-2147483647:0}] [L647] EXPR list->next VAL [\old(c)=0, \read(*list)={-1216889031:0}, c=1, length=1, list={-2147483647:0}, list->next={0:0}] [L647] struct item *next = list->next; [L648] EXPR \read(*list) VAL [\old(c)=0, \read(*list)={-1216889031:0}, c=1, length=1, list={-2147483647:0}, next={0:0}] [L648] free(list) VAL [\old(c)=0, \read(*list)={-1216889031:0}, c=1, length=1, list={-2147483647:0}, next={0:0}] [L648] free(list) VAL [\old(c)=0, \read(*list)={-1216889031:0}, c=1, length=1, list={-2147483647:0}, next={0:0}] [L648] free(list) [L649] list = next VAL [\old(c)=0, c=1, length=1, list={-2147483647:0}, next={0:0}] [L650] length-- VAL [\old(c)=0, c=1, length=0, list={-2147483647:0}, next={0:0}] [L652] COND FALSE !(length > 0) VAL [\old(c)=0, c=1, length=0, list={-2147483647:0}, next={0:0}] [L658] return 0; [L637] struct item *list = ((void *)0); [L658] return 0; VAL [\old(c)=0, \result=0, c=1, length=0, next={0:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 101 locations, 44 error locations. UNSAFE Result, 40.5s OverallTime, 17 OverallIterations, 2 TraceHistogramMax, 26.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 925 SDtfs, 1424 SDslu, 2910 SDs, 0 SdLazy, 3210 SolverSat, 150 SolverUnsat, 13 SolverUnknown, 0 SolverNotchecked, 21.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 427 GetRequests, 290 SyntacticMatches, 4 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 7.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=113occurred in iteration=7, 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, 16 MinimizatonAttempts, 168 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 11.3s InterpolantComputationTime, 377 NumberOfCodeBlocks, 377 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 383 ConstructedInterpolants, 46 QuantifiedInterpolants, 117797 SizeOfPredicates, 126 NumberOfNonLiveVariables, 1800 ConjunctsInSsa, 198 ConjunctsInUnsatCore, 18 InterpolantComputations, 14 PerfectInterpolantSequences, 8/28 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...