./Ultimate.py --spec /storage/repos/svcomp/c/properties/valid-memsafety.prp --file /storage/repos/svcomp/c/memsafety/test-0232_false-valid-memtrack.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/memsafety/test-0232_false-valid-memtrack.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 e9df23a7e56f2cc55ab4eafe0f0a27c6f539ef31 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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/memsafety/test-0232_false-valid-memtrack.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 e9df23a7e56f2cc55ab4eafe0f0a27c6f539ef31 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-13 22:10:54,336 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-13 22:10:54,338 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-13 22:10:54,349 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-13 22:10:54,350 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-13 22:10:54,351 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-13 22:10:54,352 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-13 22:10:54,363 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-13 22:10:54,365 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-13 22:10:54,366 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-13 22:10:54,366 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-13 22:10:54,367 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-13 22:10:54,367 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-13 22:10:54,368 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-13 22:10:54,369 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-13 22:10:54,370 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-13 22:10:54,371 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-13 22:10:54,373 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-13 22:10:54,375 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-13 22:10:54,376 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-13 22:10:54,377 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-13 22:10:54,378 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-13 22:10:54,380 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-13 22:10:54,381 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-13 22:10:54,381 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-13 22:10:54,382 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-13 22:10:54,383 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-13 22:10:54,384 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-13 22:10:54,384 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-13 22:10:54,385 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-13 22:10:54,386 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-13 22:10:54,386 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-13 22:10:54,386 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-13 22:10:54,387 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-13 22:10:54,387 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-13 22:10:54,388 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-13 22:10:54,388 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-01-13 22:10:54,403 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-13 22:10:54,403 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-13 22:10:54,404 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-13 22:10:54,405 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-13 22:10:54,405 INFO L133 SettingsManager]: * Use SBE=true [2019-01-13 22:10:54,405 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-13 22:10:54,405 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-13 22:10:54,405 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-13 22:10:54,405 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-13 22:10:54,406 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-13 22:10:54,406 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-13 22:10:54,406 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-01-13 22:10:54,406 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2019-01-13 22:10:54,406 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-01-13 22:10:54,406 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-13 22:10:54,407 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-13 22:10:54,407 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-13 22:10:54,407 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-13 22:10:54,407 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-13 22:10:54,407 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-13 22:10:54,407 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-13 22:10:54,408 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-13 22:10:54,408 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-13 22:10:54,408 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-13 22:10:54,408 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-13 22:10:54,408 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-13 22:10:54,409 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 -> e9df23a7e56f2cc55ab4eafe0f0a27c6f539ef31 [2019-01-13 22:10:54,443 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-13 22:10:54,467 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-13 22:10:54,471 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-13 22:10:54,472 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-13 22:10:54,473 INFO L276 PluginConnector]: CDTParser initialized [2019-01-13 22:10:54,474 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/memsafety/test-0232_false-valid-memtrack.i [2019-01-13 22:10:54,532 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1201f731a/77cfa2ac883240f79361ba7ba58d449a/FLAGb3cbfae3d [2019-01-13 22:10:55,065 INFO L307 CDTParser]: Found 1 translation units. [2019-01-13 22:10:55,065 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/memsafety/test-0232_false-valid-memtrack.i [2019-01-13 22:10:55,083 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1201f731a/77cfa2ac883240f79361ba7ba58d449a/FLAGb3cbfae3d [2019-01-13 22:10:55,298 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1201f731a/77cfa2ac883240f79361ba7ba58d449a [2019-01-13 22:10:55,301 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-13 22:10:55,302 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-01-13 22:10:55,303 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-13 22:10:55,304 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-13 22:10:55,307 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-13 22:10:55,308 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 10:10:55" (1/1) ... [2019-01-13 22:10:55,313 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42761afa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:10:55, skipping insertion in model container [2019-01-13 22:10:55,313 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 10:10:55" (1/1) ... [2019-01-13 22:10:55,321 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-13 22:10:55,368 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-13 22:10:55,722 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 22:10:55,735 INFO L191 MainTranslator]: Completed pre-run [2019-01-13 22:10:55,789 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 22:10:55,854 INFO L195 MainTranslator]: Completed translation [2019-01-13 22:10:55,855 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:10:55 WrapperNode [2019-01-13 22:10:55,855 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-13 22:10:55,856 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-13 22:10:55,856 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-13 22:10:55,856 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-13 22:10:55,934 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:10:55" (1/1) ... [2019-01-13 22:10:55,934 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:10:55" (1/1) ... [2019-01-13 22:10:55,954 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:10:55" (1/1) ... [2019-01-13 22:10:55,955 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:10:55" (1/1) ... [2019-01-13 22:10:55,974 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:10:55" (1/1) ... [2019-01-13 22:10:55,979 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:10:55" (1/1) ... [2019-01-13 22:10:55,984 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:10:55" (1/1) ... [2019-01-13 22:10:55,992 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-13 22:10:55,993 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-13 22:10:55,994 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-13 22:10:55,994 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-13 22:10:55,995 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:10: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-13 22:10:56,050 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-01-13 22:10:56,050 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-13 22:10:56,051 INFO L138 BoogieDeclarations]: Found implementation of procedure append [2019-01-13 22:10:56,051 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-13 22:10:56,051 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-01-13 22:10:56,051 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-01-13 22:10:56,051 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-01-13 22:10:56,052 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-01-13 22:10:56,052 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-01-13 22:10:56,052 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-01-13 22:10:56,052 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-01-13 22:10:56,052 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-01-13 22:10:56,052 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-01-13 22:10:56,053 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-01-13 22:10:56,053 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-01-13 22:10:56,053 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-01-13 22:10:56,053 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-01-13 22:10:56,053 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-01-13 22:10:56,053 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-01-13 22:10:56,053 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-01-13 22:10:56,054 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-01-13 22:10:56,054 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-01-13 22:10:56,054 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-01-13 22:10:56,054 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-01-13 22:10:56,054 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-01-13 22:10:56,054 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-01-13 22:10:56,055 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-01-13 22:10:56,055 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-01-13 22:10:56,055 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-01-13 22:10:56,055 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-01-13 22:10:56,055 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-01-13 22:10:56,056 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-01-13 22:10:56,056 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-01-13 22:10:56,056 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-01-13 22:10:56,056 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-01-13 22:10:56,056 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-01-13 22:10:56,056 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-01-13 22:10:56,056 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-01-13 22:10:56,056 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-01-13 22:10:56,057 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-01-13 22:10:56,057 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-01-13 22:10:56,057 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-01-13 22:10:56,057 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-01-13 22:10:56,057 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-01-13 22:10:56,057 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-01-13 22:10:56,057 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-01-13 22:10:56,057 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-01-13 22:10:56,058 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-01-13 22:10:56,058 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-01-13 22:10:56,058 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-01-13 22:10:56,058 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-01-13 22:10:56,058 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-01-13 22:10:56,058 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-01-13 22:10:56,058 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-01-13 22:10:56,058 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-01-13 22:10:56,059 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-01-13 22:10:56,059 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-01-13 22:10:56,059 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-01-13 22:10:56,059 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-01-13 22:10:56,059 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-01-13 22:10:56,059 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-01-13 22:10:56,059 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-01-13 22:10:56,059 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-01-13 22:10:56,059 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-01-13 22:10:56,060 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-01-13 22:10:56,060 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-01-13 22:10:56,060 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-01-13 22:10:56,060 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-01-13 22:10:56,060 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-01-13 22:10:56,060 INFO L130 BoogieDeclarations]: Found specification of procedure __secure_getenv [2019-01-13 22:10:56,060 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-01-13 22:10:56,060 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-01-13 22:10:56,061 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-01-13 22:10:56,061 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-01-13 22:10:56,061 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-01-13 22:10:56,061 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-01-13 22:10:56,061 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-01-13 22:10:56,061 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-01-13 22:10:56,061 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-01-13 22:10:56,061 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-01-13 22:10:56,062 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-01-13 22:10:56,062 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-01-13 22:10:56,062 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-01-13 22:10:56,062 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-01-13 22:10:56,062 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-01-13 22:10:56,062 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-01-13 22:10:56,062 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-01-13 22:10:56,063 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-01-13 22:10:56,063 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-01-13 22:10:56,063 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-01-13 22:10:56,063 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-01-13 22:10:56,063 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-01-13 22:10:56,063 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-01-13 22:10:56,063 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-01-13 22:10:56,063 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-01-13 22:10:56,064 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-01-13 22:10:56,064 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-01-13 22:10:56,064 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-01-13 22:10:56,064 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-01-13 22:10:56,064 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-01-13 22:10:56,064 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-01-13 22:10:56,064 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-01-13 22:10:56,064 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-01-13 22:10:56,065 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-01-13 22:10:56,065 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-01-13 22:10:56,065 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-01-13 22:10:56,065 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-01-13 22:10:56,065 INFO L130 BoogieDeclarations]: Found specification of procedure append [2019-01-13 22:10:56,065 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-13 22:10:56,065 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-01-13 22:10:56,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-01-13 22:10:56,066 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-13 22:10:56,066 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-13 22:10:56,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-01-13 22:10:56,066 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-13 22:10:56,066 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-01-13 22:10:56,066 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-13 22:10:56,952 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-13 22:10:56,952 INFO L286 CfgBuilder]: Removed 2 assue(true) statements. [2019-01-13 22:10:56,953 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 10:10:56 BoogieIcfgContainer [2019-01-13 22:10:56,953 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-13 22:10:56,954 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-13 22:10:56,954 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-13 22:10:56,957 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-13 22:10:56,957 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.01 10:10:55" (1/3) ... [2019-01-13 22:10:56,958 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c49a42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 10:10:56, skipping insertion in model container [2019-01-13 22:10:56,958 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:10:55" (2/3) ... [2019-01-13 22:10:56,959 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c49a42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 10:10:56, skipping insertion in model container [2019-01-13 22:10:56,959 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 10:10:56" (3/3) ... [2019-01-13 22:10:56,961 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0232_false-valid-memtrack.i [2019-01-13 22:10:56,968 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-13 22:10:56,975 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 41 error locations. [2019-01-13 22:10:56,989 INFO L257 AbstractCegarLoop]: Starting to check reachability of 41 error locations. [2019-01-13 22:10:57,014 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-13 22:10:57,015 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-13 22:10:57,015 INFO L383 AbstractCegarLoop]: Hoare is false [2019-01-13 22:10:57,015 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-13 22:10:57,016 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-13 22:10:57,016 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-13 22:10:57,017 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-13 22:10:57,017 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-13 22:10:57,017 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-13 22:10:57,038 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states. [2019-01-13 22:10:57,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-13 22:10:57,047 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:10:57,048 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:10:57,051 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr15REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION]=== [2019-01-13 22:10:57,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:10:57,057 INFO L82 PathProgramCache]: Analyzing trace with hash 2122807630, now seen corresponding path program 1 times [2019-01-13 22:10:57,059 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:10:57,059 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:10:57,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:10:57,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:10:57,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:10:57,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:10:57,176 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-13 22:10:57,178 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:10:57,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-13 22:10:57,182 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-01-13 22:10:57,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-13 22:10:57,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-13 22:10:57,194 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 2 states. [2019-01-13 22:10:57,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:10:57,213 INFO L93 Difference]: Finished difference Result 89 states and 92 transitions. [2019-01-13 22:10:57,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-13 22:10:57,214 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 8 [2019-01-13 22:10:57,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:10:57,223 INFO L225 Difference]: With dead ends: 89 [2019-01-13 22:10:57,223 INFO L226 Difference]: Without dead ends: 86 [2019-01-13 22:10:57,225 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-13 22:10:57,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-01-13 22:10:57,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2019-01-13 22:10:57,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-01-13 22:10:57,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 89 transitions. [2019-01-13 22:10:57,266 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 89 transitions. Word has length 8 [2019-01-13 22:10:57,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:10:57,267 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 89 transitions. [2019-01-13 22:10:57,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-01-13 22:10:57,267 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 89 transitions. [2019-01-13 22:10:57,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-13 22:10:57,268 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:10:57,268 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:10:57,268 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr15REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION]=== [2019-01-13 22:10:57,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:10:57,269 INFO L82 PathProgramCache]: Analyzing trace with hash 1382626283, now seen corresponding path program 1 times [2019-01-13 22:10:57,269 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:10:57,269 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:10:57,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:10:57,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:10:57,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:10:57,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:10:57,658 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-13 22:10:57,658 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:10:57,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 22:10:57,660 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 22:10:57,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 22:10:57,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 22:10:57,661 INFO L87 Difference]: Start difference. First operand 86 states and 89 transitions. Second operand 5 states. [2019-01-13 22:10:58,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:10:58,455 INFO L93 Difference]: Finished difference Result 99 states and 103 transitions. [2019-01-13 22:10:58,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 22:10:58,456 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-01-13 22:10:58,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:10:58,459 INFO L225 Difference]: With dead ends: 99 [2019-01-13 22:10:58,459 INFO L226 Difference]: Without dead ends: 99 [2019-01-13 22:10:58,460 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-13 22:10:58,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-01-13 22:10:58,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 87. [2019-01-13 22:10:58,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-01-13 22:10:58,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 96 transitions. [2019-01-13 22:10:58,470 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 96 transitions. Word has length 9 [2019-01-13 22:10:58,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:10:58,471 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 96 transitions. [2019-01-13 22:10:58,471 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 22:10:58,471 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 96 transitions. [2019-01-13 22:10:58,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-13 22:10:58,471 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:10:58,472 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:10:58,472 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr15REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION]=== [2019-01-13 22:10:58,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:10:58,473 INFO L82 PathProgramCache]: Analyzing trace with hash 1382626284, now seen corresponding path program 1 times [2019-01-13 22:10:58,473 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:10:58,473 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:10:58,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:10:58,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:10:58,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:10:58,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:10:58,646 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-13 22:10:58,646 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:10:58,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 22:10:58,647 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 22:10:58,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 22:10:58,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 22:10:58,648 INFO L87 Difference]: Start difference. First operand 87 states and 96 transitions. Second operand 5 states. [2019-01-13 22:10:59,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:10:59,003 INFO L93 Difference]: Finished difference Result 85 states and 91 transitions. [2019-01-13 22:10:59,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 22:10:59,005 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-01-13 22:10:59,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:10:59,010 INFO L225 Difference]: With dead ends: 85 [2019-01-13 22:10:59,010 INFO L226 Difference]: Without dead ends: 85 [2019-01-13 22:10:59,010 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-13 22:10:59,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-01-13 22:10:59,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 81. [2019-01-13 22:10:59,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-01-13 22:10:59,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 89 transitions. [2019-01-13 22:10:59,020 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 89 transitions. Word has length 9 [2019-01-13 22:10:59,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:10:59,021 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 89 transitions. [2019-01-13 22:10:59,021 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 22:10:59,021 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 89 transitions. [2019-01-13 22:10:59,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-13 22:10:59,021 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:10:59,022 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:10:59,023 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr15REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION]=== [2019-01-13 22:10:59,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:10:59,025 INFO L82 PathProgramCache]: Analyzing trace with hash -88258129, now seen corresponding path program 1 times [2019-01-13 22:10:59,025 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:10:59,025 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:10:59,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:10:59,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:10:59,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:10:59,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:10:59,068 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-13 22:10:59,069 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:10:59,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-13 22:10:59,070 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 22:10:59,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 22:10:59,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 22:10:59,071 INFO L87 Difference]: Start difference. First operand 81 states and 89 transitions. Second operand 3 states. [2019-01-13 22:10:59,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:10:59,171 INFO L93 Difference]: Finished difference Result 77 states and 84 transitions. [2019-01-13 22:10:59,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 22:10:59,176 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-01-13 22:10:59,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:10:59,177 INFO L225 Difference]: With dead ends: 77 [2019-01-13 22:10:59,177 INFO L226 Difference]: Without dead ends: 77 [2019-01-13 22:10:59,178 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-13 22:10:59,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-01-13 22:10:59,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-01-13 22:10:59,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-01-13 22:10:59,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 84 transitions. [2019-01-13 22:10:59,197 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 84 transitions. Word has length 10 [2019-01-13 22:10:59,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:10:59,197 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 84 transitions. [2019-01-13 22:10:59,197 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 22:10:59,198 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 84 transitions. [2019-01-13 22:10:59,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-13 22:10:59,198 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:10:59,198 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:10:59,202 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr15REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION]=== [2019-01-13 22:10:59,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:10:59,202 INFO L82 PathProgramCache]: Analyzing trace with hash -88258128, now seen corresponding path program 1 times [2019-01-13 22:10:59,202 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:10:59,202 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:10:59,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:10:59,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:10:59,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:10:59,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:10:59,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-13 22:10:59,289 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:10:59,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-13 22:10:59,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 22:10:59,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 22:10:59,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 22:10:59,290 INFO L87 Difference]: Start difference. First operand 77 states and 84 transitions. Second operand 3 states. [2019-01-13 22:10:59,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:10:59,403 INFO L93 Difference]: Finished difference Result 73 states and 79 transitions. [2019-01-13 22:10:59,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 22:10:59,404 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-01-13 22:10:59,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:10:59,405 INFO L225 Difference]: With dead ends: 73 [2019-01-13 22:10:59,405 INFO L226 Difference]: Without dead ends: 73 [2019-01-13 22:10:59,406 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-13 22:10:59,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-01-13 22:10:59,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-01-13 22:10:59,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-01-13 22:10:59,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 79 transitions. [2019-01-13 22:10:59,414 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 79 transitions. Word has length 10 [2019-01-13 22:10:59,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:10:59,414 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 79 transitions. [2019-01-13 22:10:59,415 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 22:10:59,415 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 79 transitions. [2019-01-13 22:10:59,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-13 22:10:59,415 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:10:59,416 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:10:59,416 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr15REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION]=== [2019-01-13 22:10:59,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:10:59,416 INFO L82 PathProgramCache]: Analyzing trace with hash -213829514, now seen corresponding path program 1 times [2019-01-13 22:10:59,417 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:10:59,417 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:10:59,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:10:59,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:10:59,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:10:59,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:10:59,621 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-13 22:10:59,622 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:10:59,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-13 22:10:59,622 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-13 22:10:59,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-13 22:10:59,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-01-13 22:10:59,623 INFO L87 Difference]: Start difference. First operand 73 states and 79 transitions. Second operand 8 states. [2019-01-13 22:10:59,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:10:59,935 INFO L93 Difference]: Finished difference Result 84 states and 91 transitions. [2019-01-13 22:10:59,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-13 22:10:59,935 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2019-01-13 22:10:59,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:10:59,937 INFO L225 Difference]: With dead ends: 84 [2019-01-13 22:10:59,938 INFO L226 Difference]: Without dead ends: 84 [2019-01-13 22:10:59,938 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2019-01-13 22:10:59,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-01-13 22:10:59,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 80. [2019-01-13 22:10:59,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-01-13 22:10:59,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 87 transitions. [2019-01-13 22:10:59,948 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 87 transitions. Word has length 15 [2019-01-13 22:10:59,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:10:59,949 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 87 transitions. [2019-01-13 22:10:59,949 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-13 22:10:59,949 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 87 transitions. [2019-01-13 22:10:59,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-13 22:10:59,950 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:10:59,951 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:10:59,952 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr15REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION]=== [2019-01-13 22:10:59,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:10:59,952 INFO L82 PathProgramCache]: Analyzing trace with hash 1961497780, now seen corresponding path program 1 times [2019-01-13 22:10:59,952 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:10:59,952 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:10:59,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:10:59,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:10:59,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:10:59,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:11:00,151 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-13 22:11:00,152 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:11:00,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 22:11:00,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 22:11:00,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 22:11:00,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-13 22:11:00,153 INFO L87 Difference]: Start difference. First operand 80 states and 87 transitions. Second operand 7 states. [2019-01-13 22:11:00,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:11:00,371 INFO L93 Difference]: Finished difference Result 79 states and 86 transitions. [2019-01-13 22:11:00,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-13 22:11:00,372 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2019-01-13 22:11:00,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:11:00,374 INFO L225 Difference]: With dead ends: 79 [2019-01-13 22:11:00,374 INFO L226 Difference]: Without dead ends: 79 [2019-01-13 22:11:00,375 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-01-13 22:11:00,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-01-13 22:11:00,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 76. [2019-01-13 22:11:00,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-01-13 22:11:00,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 83 transitions. [2019-01-13 22:11:00,382 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 83 transitions. Word has length 16 [2019-01-13 22:11:00,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:11:00,382 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 83 transitions. [2019-01-13 22:11:00,382 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 22:11:00,382 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2019-01-13 22:11:00,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-13 22:11:00,384 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:11:00,385 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-13 22:11:00,385 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr15REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION]=== [2019-01-13 22:11:00,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:11:00,385 INFO L82 PathProgramCache]: Analyzing trace with hash 1087723232, now seen corresponding path program 1 times [2019-01-13 22:11:00,386 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:11:00,386 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:11:00,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:11:00,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:11:00,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:11:00,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:11:00,502 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-13 22:11:00,503 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:11:00,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 22:11:00,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 22:11:00,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 22:11:00,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-13 22:11:00,505 INFO L87 Difference]: Start difference. First operand 76 states and 83 transitions. Second operand 7 states. [2019-01-13 22:11:00,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:11:00,850 INFO L93 Difference]: Finished difference Result 84 states and 89 transitions. [2019-01-13 22:11:00,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 22:11:00,851 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2019-01-13 22:11:00,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:11:00,853 INFO L225 Difference]: With dead ends: 84 [2019-01-13 22:11:00,853 INFO L226 Difference]: Without dead ends: 84 [2019-01-13 22:11:00,854 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-01-13 22:11:00,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-01-13 22:11:00,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 75. [2019-01-13 22:11:00,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-01-13 22:11:00,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 82 transitions. [2019-01-13 22:11:00,860 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 82 transitions. Word has length 24 [2019-01-13 22:11:00,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:11:00,863 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 82 transitions. [2019-01-13 22:11:00,863 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 22:11:00,863 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2019-01-13 22:11:00,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-13 22:11:00,864 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:11:00,864 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-13 22:11:00,864 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr15REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION]=== [2019-01-13 22:11:00,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:11:00,867 INFO L82 PathProgramCache]: Analyzing trace with hash 1087723233, now seen corresponding path program 1 times [2019-01-13 22:11:00,867 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:11:00,867 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:11:00,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:11:00,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:11:00,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:11:00,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:11:01,023 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-13 22:11:01,023 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:11:01,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 22:11:01,024 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 22:11:01,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 22:11:01,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-13 22:11:01,024 INFO L87 Difference]: Start difference. First operand 75 states and 82 transitions. Second operand 7 states. [2019-01-13 22:11:01,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:11:01,289 INFO L93 Difference]: Finished difference Result 85 states and 90 transitions. [2019-01-13 22:11:01,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 22:11:01,290 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2019-01-13 22:11:01,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:11:01,291 INFO L225 Difference]: With dead ends: 85 [2019-01-13 22:11:01,292 INFO L226 Difference]: Without dead ends: 85 [2019-01-13 22:11:01,292 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-13 22:11:01,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-01-13 22:11:01,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 74. [2019-01-13 22:11:01,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-01-13 22:11:01,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 81 transitions. [2019-01-13 22:11:01,297 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 81 transitions. Word has length 24 [2019-01-13 22:11:01,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:11:01,298 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 81 transitions. [2019-01-13 22:11:01,298 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 22:11:01,298 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2019-01-13 22:11:01,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-13 22:11:01,299 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:11:01,299 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] [2019-01-13 22:11:01,300 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr15REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION]=== [2019-01-13 22:11:01,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:11:01,315 INFO L82 PathProgramCache]: Analyzing trace with hash 1645139224, now seen corresponding path program 1 times [2019-01-13 22:11:01,315 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:11:01,315 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:11:01,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:11:01,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:11:01,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:11:01,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:11:01,416 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-13 22:11:01,416 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:11:01,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 22:11:01,416 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 22:11:01,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 22:11:01,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-13 22:11:01,417 INFO L87 Difference]: Start difference. First operand 74 states and 81 transitions. Second operand 6 states. [2019-01-13 22:11:01,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:11:01,536 INFO L93 Difference]: Finished difference Result 68 states and 71 transitions. [2019-01-13 22:11:01,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 22:11:01,537 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-01-13 22:11:01,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:11:01,538 INFO L225 Difference]: With dead ends: 68 [2019-01-13 22:11:01,538 INFO L226 Difference]: Without dead ends: 68 [2019-01-13 22:11:01,539 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-01-13 22:11:01,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-01-13 22:11:01,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-01-13 22:11:01,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-01-13 22:11:01,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2019-01-13 22:11:01,545 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 26 [2019-01-13 22:11:01,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:11:01,546 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2019-01-13 22:11:01,546 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 22:11:01,546 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2019-01-13 22:11:01,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-13 22:11:01,547 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:11:01,547 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-13 22:11:01,547 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr15REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION]=== [2019-01-13 22:11:01,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:11:01,547 INFO L82 PathProgramCache]: Analyzing trace with hash -1165444767, now seen corresponding path program 1 times [2019-01-13 22:11:01,548 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:11:01,551 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:11:01,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:11:01,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:11:01,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:11:01,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:11:01,871 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-13 22:11:01,872 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:11:01,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 22:11:01,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 22:11:01,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 22:11:01,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-13 22:11:01,873 INFO L87 Difference]: Start difference. First operand 68 states and 71 transitions. Second operand 6 states. [2019-01-13 22:11:02,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:11:02,064 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2019-01-13 22:11:02,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 22:11:02,066 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-01-13 22:11:02,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:11:02,067 INFO L225 Difference]: With dead ends: 67 [2019-01-13 22:11:02,067 INFO L226 Difference]: Without dead ends: 67 [2019-01-13 22:11:02,068 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-01-13 22:11:02,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-01-13 22:11:02,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-01-13 22:11:02,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-01-13 22:11:02,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 70 transitions. [2019-01-13 22:11:02,071 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 70 transitions. Word has length 27 [2019-01-13 22:11:02,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:11:02,072 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 70 transitions. [2019-01-13 22:11:02,072 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 22:11:02,072 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 70 transitions. [2019-01-13 22:11:02,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-01-13 22:11:02,073 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:11:02,073 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-13 22:11:02,073 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr15REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION]=== [2019-01-13 22:11:02,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:11:02,074 INFO L82 PathProgramCache]: Analyzing trace with hash -1769049343, now seen corresponding path program 1 times [2019-01-13 22:11:02,074 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:11:02,074 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:11:02,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:11:02,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:11:02,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:11:02,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:11:02,457 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-13 22:11:02,457 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:11:02,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 22:11:02,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 22:11:02,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 22:11:02,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-13 22:11:02,458 INFO L87 Difference]: Start difference. First operand 67 states and 70 transitions. Second operand 6 states. [2019-01-13 22:11:02,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:11:02,617 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2019-01-13 22:11:02,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 22:11:02,618 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-01-13 22:11:02,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:11:02,619 INFO L225 Difference]: With dead ends: 66 [2019-01-13 22:11:02,619 INFO L226 Difference]: Without dead ends: 66 [2019-01-13 22:11:02,619 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-01-13 22:11:02,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-01-13 22:11:02,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-01-13 22:11:02,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-01-13 22:11:02,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 69 transitions. [2019-01-13 22:11:02,622 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 69 transitions. Word has length 28 [2019-01-13 22:11:02,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:11:02,624 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 69 transitions. [2019-01-13 22:11:02,624 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 22:11:02,624 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 69 transitions. [2019-01-13 22:11:02,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-01-13 22:11:02,625 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:11:02,625 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-13 22:11:02,627 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr15REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION]=== [2019-01-13 22:11:02,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:11:02,628 INFO L82 PathProgramCache]: Analyzing trace with hash -538427448, now seen corresponding path program 1 times [2019-01-13 22:11:02,628 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:11:02,628 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:11:02,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:11:02,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:11:02,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:11:02,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:11:02,911 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-13 22:11:02,911 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 22:11:02,912 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-13 22:11:02,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:11:02,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:11:02,980 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 22:11:03,104 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2019-01-13 22:11:03,107 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-13 22:11:03,108 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:11:03,110 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:11:03,118 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-13 22:11:03,118 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2019-01-13 22:11:03,237 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-13 22:11:03,238 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 22:11:03,313 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:11:03,313 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2019-01-13 22:11:03,480 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 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-13 22:11:03,493 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-13 22:11:03,493 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:11:03,547 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:11:03,586 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-13 22:11:03,587 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2019-01-13 22:11:03,637 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-13 22:11:03,648 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 24 treesize of output 17 [2019-01-13 22:11:03,649 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:11:03,686 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 17 treesize of output 10 [2019-01-13 22:11:03,686 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-13 22:11:03,718 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-13 22:11:03,719 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-13 22:11:03,732 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:11:03,736 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-13 22:11:03,736 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:33, output treesize:11 [2019-01-13 22:11:03,753 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-13 22:11:03,776 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 22:11:03,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 15 [2019-01-13 22:11:03,777 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-13 22:11:03,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-13 22:11:03,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-01-13 22:11:03,778 INFO L87 Difference]: Start difference. First operand 66 states and 69 transitions. Second operand 16 states. [2019-01-13 22:11:04,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:11:04,744 INFO L93 Difference]: Finished difference Result 72 states and 74 transitions. [2019-01-13 22:11:04,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-13 22:11:04,745 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 29 [2019-01-13 22:11:04,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:11:04,747 INFO L225 Difference]: With dead ends: 72 [2019-01-13 22:11:04,747 INFO L226 Difference]: Without dead ends: 72 [2019-01-13 22:11:04,748 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=133, Invalid=467, Unknown=0, NotChecked=0, Total=600 [2019-01-13 22:11:04,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-01-13 22:11:04,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2019-01-13 22:11:04,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-01-13 22:11:04,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 72 transitions. [2019-01-13 22:11:04,753 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 72 transitions. Word has length 29 [2019-01-13 22:11:04,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:11:04,753 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 72 transitions. [2019-01-13 22:11:04,753 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-13 22:11:04,753 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 72 transitions. [2019-01-13 22:11:04,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-01-13 22:11:04,754 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:11:04,754 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-13 22:11:04,756 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr15REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION]=== [2019-01-13 22:11:04,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:11:04,757 INFO L82 PathProgramCache]: Analyzing trace with hash -538427447, now seen corresponding path program 1 times [2019-01-13 22:11:04,757 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:11:04,757 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:11:04,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:11:04,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:11:04,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:11:04,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:11:05,047 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 10 [2019-01-13 22:11:05,226 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-13 22:11:05,227 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 22:11:05,227 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-13 22:11:05,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:11:05,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:11:05,281 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 22:11:05,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-13 22:11:05,641 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-13 22:11:05,641 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:11:05,650 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:11:05,666 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-13 22:11:05,668 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-13 22:11:05,668 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-13 22:11:05,670 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:11:05,677 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-13 22:11:05,678 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:33, output treesize:26 [2019-01-13 22:11:05,834 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:11:05,835 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:11:05,836 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-13 22:11:05,836 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 22:11:05,853 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-13 22:11:05,853 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:11:05,869 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:11:05,870 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:33 [2019-01-13 22:11:06,069 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-13 22:11:06,075 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-13 22:11:06,076 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:11:06,110 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:11:06,162 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-13 22:11:06,169 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-13 22:11:06,170 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-13 22:11:06,200 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-13 22:11:06,201 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-13 22:11:06,218 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:11:06,231 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-13 22:11:06,232 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:60, output treesize:52 [2019-01-13 22:11:06,345 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-13 22:11:06,367 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-13 22:11:06,368 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:11:06,389 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-13 22:11:06,390 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-13 22:11:06,411 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-13 22:11:06,411 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-13 22:11:06,421 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:11:06,445 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-13 22:11:06,449 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-13 22:11:06,449 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-13 22:11:06,458 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:11:06,467 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-13 22:11:06,468 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:66, output treesize:18 [2019-01-13 22:11:06,529 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-13 22:11:06,556 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 22:11:06,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 18 [2019-01-13 22:11:06,557 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-01-13 22:11:06,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-01-13 22:11:06,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2019-01-13 22:11:06,557 INFO L87 Difference]: Start difference. First operand 70 states and 72 transitions. Second operand 19 states. [2019-01-13 22:11:08,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:11:08,406 INFO L93 Difference]: Finished difference Result 71 states and 73 transitions. [2019-01-13 22:11:08,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-13 22:11:08,407 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 29 [2019-01-13 22:11:08,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:11:08,409 INFO L225 Difference]: With dead ends: 71 [2019-01-13 22:11:08,409 INFO L226 Difference]: Without dead ends: 71 [2019-01-13 22:11:08,409 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=132, Invalid=570, Unknown=0, NotChecked=0, Total=702 [2019-01-13 22:11:08,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-01-13 22:11:08,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 69. [2019-01-13 22:11:08,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-01-13 22:11:08,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 71 transitions. [2019-01-13 22:11:08,412 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 71 transitions. Word has length 29 [2019-01-13 22:11:08,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:11:08,412 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 71 transitions. [2019-01-13 22:11:08,412 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-01-13 22:11:08,413 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 71 transitions. [2019-01-13 22:11:08,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-01-13 22:11:08,415 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:11:08,416 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-13 22:11:08,417 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr15REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION]=== [2019-01-13 22:11:08,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:11:08,417 INFO L82 PathProgramCache]: Analyzing trace with hash 994045283, now seen corresponding path program 1 times [2019-01-13 22:11:08,417 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:11:08,417 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:11:08,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:11:08,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:11:08,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:11:08,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:11:09,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-13 22:11:09,020 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:11:09,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 22:11:09,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 22:11:09,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 22:11:09,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-13 22:11:09,021 INFO L87 Difference]: Start difference. First operand 69 states and 71 transitions. Second operand 7 states. [2019-01-13 22:11:09,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:11:09,197 INFO L93 Difference]: Finished difference Result 68 states and 70 transitions. [2019-01-13 22:11:09,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 22:11:09,198 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2019-01-13 22:11:09,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:11:09,200 INFO L225 Difference]: With dead ends: 68 [2019-01-13 22:11:09,200 INFO L226 Difference]: Without dead ends: 68 [2019-01-13 22:11:09,200 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-01-13 22:11:09,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-01-13 22:11:09,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-01-13 22:11:09,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-01-13 22:11:09,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 70 transitions. [2019-01-13 22:11:09,205 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 70 transitions. Word has length 29 [2019-01-13 22:11:09,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:11:09,205 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 70 transitions. [2019-01-13 22:11:09,206 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 22:11:09,206 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 70 transitions. [2019-01-13 22:11:09,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-13 22:11:09,206 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:11:09,207 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-13 22:11:09,209 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr15REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION]=== [2019-01-13 22:11:09,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:11:09,210 INFO L82 PathProgramCache]: Analyzing trace with hash 750632772, now seen corresponding path program 1 times [2019-01-13 22:11:09,211 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:11:09,211 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:11:09,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:11:09,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:11:09,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:11:09,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:11:09,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 22:11:09,455 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:11:09,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 22:11:09,455 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-13 22:11:09,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-13 22:11:09,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-01-13 22:11:09,456 INFO L87 Difference]: Start difference. First operand 68 states and 70 transitions. Second operand 8 states. [2019-01-13 22:11:09,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:11:09,644 INFO L93 Difference]: Finished difference Result 64 states and 66 transitions. [2019-01-13 22:11:09,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 22:11:09,645 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 30 [2019-01-13 22:11:09,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:11:09,646 INFO L225 Difference]: With dead ends: 64 [2019-01-13 22:11:09,646 INFO L226 Difference]: Without dead ends: 64 [2019-01-13 22:11:09,647 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-13 22:11:09,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-01-13 22:11:09,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-01-13 22:11:09,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-01-13 22:11:09,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 66 transitions. [2019-01-13 22:11:09,651 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 66 transitions. Word has length 30 [2019-01-13 22:11:09,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:11:09,652 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 66 transitions. [2019-01-13 22:11:09,652 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-13 22:11:09,652 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 66 transitions. [2019-01-13 22:11:09,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-01-13 22:11:09,653 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:11:09,655 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-13 22:11:09,655 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr15REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION]=== [2019-01-13 22:11:09,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:11:09,657 INFO L82 PathProgramCache]: Analyzing trace with hash 227346506, now seen corresponding path program 1 times [2019-01-13 22:11:09,657 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:11:09,657 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:11:09,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:11:09,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:11:09,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:11:09,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-13 22:11:09,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-13 22:11:09,727 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-13 22:11:09,747 WARN L416 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2019-01-13 22:11:09,767 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.01 10:11:09 BoogieIcfgContainer [2019-01-13 22:11:09,767 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-13 22:11:09,768 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-13 22:11:09,768 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-13 22:11:09,768 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-13 22:11:09,768 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 10:10:56" (3/4) ... [2019-01-13 22:11:09,774 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-13 22:11:09,774 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-13 22:11:09,775 INFO L168 Benchmark]: Toolchain (without parser) took 14473.32 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 278.9 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -105.9 MB). Peak memory consumption was 173.0 MB. Max. memory is 11.5 GB. [2019-01-13 22:11:09,776 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-13 22:11:09,776 INFO L168 Benchmark]: CACSL2BoogieTranslator took 552.05 ms. Allocated memory is still 1.0 GB. Free memory was 942.0 MB in the beginning and 920.5 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2019-01-13 22:11:09,777 INFO L168 Benchmark]: Boogie Preprocessor took 136.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 920.5 MB in the beginning and 1.1 GB in the end (delta: -212.1 MB). Peak memory consumption was 14.1 MB. Max. memory is 11.5 GB. [2019-01-13 22:11:09,779 INFO L168 Benchmark]: RCFGBuilder took 960.57 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.7 MB). Peak memory consumption was 50.7 MB. Max. memory is 11.5 GB. [2019-01-13 22:11:09,780 INFO L168 Benchmark]: TraceAbstraction took 12813.25 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 133.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 28.7 MB). Peak memory consumption was 161.8 MB. Max. memory is 11.5 GB. [2019-01-13 22:11:09,781 INFO L168 Benchmark]: Witness Printer took 6.46 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-13 22:11:09,786 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 552.05 ms. Allocated memory is still 1.0 GB. Free memory was 942.0 MB in the beginning and 920.5 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 136.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 920.5 MB in the beginning and 1.1 GB in the end (delta: -212.1 MB). Peak memory consumption was 14.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 960.57 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.7 MB). Peak memory consumption was 50.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 12813.25 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 133.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 28.7 MB). Peak memory consumption was 161.8 MB. Max. memory is 11.5 GB. * Witness Printer took 6.46 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: 633]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 633. Possible FailurePath: [L635] struct item *list = ((void *)0); VAL [list={-1:0}] [L637] CALL append(&list) VAL [plist={-1:0}] [L626] struct item *item = malloc(sizeof *item); VAL [item={1:0}, malloc(sizeof *item)={1:0}, plist={-1:0}, plist={-1:0}] [L627] EXPR \read(**plist) VAL [\read(**plist)={0:0}, item={1:0}, malloc(sizeof *item)={1:0}, plist={-1:0}, plist={-1:0}] [L627] item->next = *plist VAL [\read(**plist)={0:0}, item={1:0}, malloc(sizeof *item)={1:0}, plist={-1:0}, plist={-1:0}] [L628] EXPR item->next VAL [item={1:0}, item->next={0:0}, malloc(sizeof *item)={1:0}, plist={-1:0}, plist={-1:0}] [L628-L630] EXPR (item->next) ? item->next->data : malloc(sizeof *item) [L628-L630] EXPR (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={2:0}, item={1:0}, item->next={0:0}, malloc(sizeof *item)={2:0}, malloc(sizeof *item)={1:0}, plist={-1:0}, plist={-1:0}] [L628-L630] item->data = (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={2:0}, item={1:0}, item->next={0:0}, malloc(sizeof *item)={2:0}, malloc(sizeof *item)={1:0}, plist={-1:0}, plist={-1:0}] [L631] *plist = item VAL [item={1:0}, malloc(sizeof *item)={2:0}, malloc(sizeof *item)={1:0}, plist={-1:0}, plist={-1:0}] [L637] RET append(&list) VAL [list={-1:0}] [L638] COND FALSE !(__VERIFIER_nondet_int()) [L639] \read(*list) VAL [\read(*list)={1:0}, list={-1:0}] [L639] COND TRUE \read(*list) [L640] EXPR \read(*list) VAL [\read(*list)={1:0}, list={-1:0}] [L640] EXPR list->next VAL [\read(*list)={1:0}, list={-1:0}, list->next={0:0}] [L640] struct item *next = list->next; [L641] EXPR \read(*list) VAL [\read(*list)={1:0}, list={-1:0}, next={0:0}] [L641] free(list) VAL [\read(*list)={1:0}, list={-1:0}, next={0:0}] [L641] free(list) VAL [\read(*list)={1:0}, list={-1:0}, next={0:0}] [L641] free(list) [L642] list = next VAL [list={-1:0}, next={0:0}] [L644] \read(*list) VAL [\read(*list)={0:0}, list={-1:0}, next={0:0}] [L644] COND FALSE !(\read(*list)) [L649] return 0; [L635] struct item *list = ((void *)0); [L649] return 0; VAL [\result=0, next={0:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 89 locations, 41 error locations. UNSAFE Result, 12.7s OverallTime, 17 OverallIterations, 2 TraceHistogramMax, 6.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 778 SDtfs, 738 SDslu, 2188 SDs, 0 SdLazy, 2275 SolverSat, 113 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 190 GetRequests, 57 SyntacticMatches, 7 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 5.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=89occurred in iteration=0, 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, 47 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 5.5s InterpolantComputationTime, 415 NumberOfCodeBlocks, 415 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 363 ConstructedInterpolants, 11 QuantifiedInterpolants, 78210 SizeOfPredicates, 35 NumberOfNonLiveVariables, 374 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-13 22:11:12,000 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-13 22:11:12,002 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-13 22:11:12,014 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-13 22:11:12,014 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-13 22:11:12,015 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-13 22:11:12,016 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-13 22:11:12,019 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-13 22:11:12,020 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-13 22:11:12,021 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-13 22:11:12,022 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-13 22:11:12,022 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-13 22:11:12,023 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-13 22:11:12,025 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-13 22:11:12,026 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-13 22:11:12,027 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-13 22:11:12,028 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-13 22:11:12,030 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-13 22:11:12,032 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-13 22:11:12,034 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-13 22:11:12,035 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-13 22:11:12,036 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-13 22:11:12,039 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-13 22:11:12,039 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-13 22:11:12,039 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-13 22:11:12,040 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-13 22:11:12,041 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-13 22:11:12,042 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-13 22:11:12,043 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-13 22:11:12,044 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-13 22:11:12,045 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-13 22:11:12,046 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-13 22:11:12,046 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-13 22:11:12,046 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-13 22:11:12,047 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-13 22:11:12,048 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-13 22:11:12,049 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-01-13 22:11:12,063 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-13 22:11:12,064 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-13 22:11:12,065 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-13 22:11:12,065 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-13 22:11:12,065 INFO L133 SettingsManager]: * Use SBE=true [2019-01-13 22:11:12,065 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-13 22:11:12,066 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-13 22:11:12,066 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-13 22:11:12,066 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-13 22:11:12,066 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-13 22:11:12,066 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-13 22:11:12,066 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-01-13 22:11:12,067 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2019-01-13 22:11:12,068 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-01-13 22:11:12,068 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-13 22:11:12,068 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2019-01-13 22:11:12,069 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-01-13 22:11:12,069 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-13 22:11:12,069 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-13 22:11:12,069 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-13 22:11:12,069 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-13 22:11:12,069 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-13 22:11:12,070 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-13 22:11:12,071 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-13 22:11:12,071 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-13 22:11:12,071 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-13 22:11:12,071 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2019-01-13 22:11:12,072 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-13 22:11:12,072 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-01-13 22:11:12,072 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 -> e9df23a7e56f2cc55ab4eafe0f0a27c6f539ef31 [2019-01-13 22:11:12,108 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-13 22:11:12,120 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-13 22:11:12,124 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-13 22:11:12,126 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-13 22:11:12,126 INFO L276 PluginConnector]: CDTParser initialized [2019-01-13 22:11:12,127 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/memsafety/test-0232_false-valid-memtrack.i [2019-01-13 22:11:12,181 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8b7d4050/5271aa95d2c941ca91596d5c9c18477a/FLAG3a20260aa [2019-01-13 22:11:12,702 INFO L307 CDTParser]: Found 1 translation units. [2019-01-13 22:11:12,703 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/memsafety/test-0232_false-valid-memtrack.i [2019-01-13 22:11:12,716 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8b7d4050/5271aa95d2c941ca91596d5c9c18477a/FLAG3a20260aa [2019-01-13 22:11:12,957 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8b7d4050/5271aa95d2c941ca91596d5c9c18477a [2019-01-13 22:11:12,961 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-13 22:11:12,962 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-01-13 22:11:12,963 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-13 22:11:12,963 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-13 22:11:12,966 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-13 22:11:12,967 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 10:11:12" (1/1) ... [2019-01-13 22:11:12,970 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2132f636 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:11:12, skipping insertion in model container [2019-01-13 22:11:12,971 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 10:11:12" (1/1) ... [2019-01-13 22:11:12,981 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-13 22:11:13,037 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-13 22:11:13,401 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 22:11:13,412 INFO L191 MainTranslator]: Completed pre-run [2019-01-13 22:11:13,537 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 22:11:13,598 INFO L195 MainTranslator]: Completed translation [2019-01-13 22:11:13,598 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:11:13 WrapperNode [2019-01-13 22:11:13,598 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-13 22:11:13,599 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-13 22:11:13,599 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-13 22:11:13,599 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-13 22:11:13,613 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:11:13" (1/1) ... [2019-01-13 22:11:13,614 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:11:13" (1/1) ... [2019-01-13 22:11:13,631 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:11:13" (1/1) ... [2019-01-13 22:11:13,632 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:11:13" (1/1) ... [2019-01-13 22:11:13,661 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:11:13" (1/1) ... [2019-01-13 22:11:13,667 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:11:13" (1/1) ... [2019-01-13 22:11:13,679 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:11:13" (1/1) ... [2019-01-13 22:11:13,693 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-13 22:11:13,694 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-13 22:11:13,694 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-13 22:11:13,694 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-13 22:11:13,699 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:11:13" (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-13 22:11:13,749 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-01-13 22:11:13,749 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-13 22:11:13,750 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.setCurrentRoundingMode [2019-01-13 22:11:13,750 INFO L138 BoogieDeclarations]: Found implementation of procedure append [2019-01-13 22:11:13,750 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-13 22:11:13,750 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-01-13 22:11:13,750 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-01-13 22:11:13,751 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-01-13 22:11:13,751 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-01-13 22:11:13,751 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-01-13 22:11:13,751 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-01-13 22:11:13,751 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-01-13 22:11:13,751 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-01-13 22:11:13,752 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-01-13 22:11:13,753 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-01-13 22:11:13,753 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-01-13 22:11:13,753 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-01-13 22:11:13,753 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-01-13 22:11:13,754 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-01-13 22:11:13,754 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-01-13 22:11:13,754 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-01-13 22:11:13,754 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-01-13 22:11:13,754 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-01-13 22:11:13,754 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-01-13 22:11:13,754 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-01-13 22:11:13,756 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-01-13 22:11:13,756 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-01-13 22:11:13,756 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-01-13 22:11:13,756 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-01-13 22:11:13,756 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-01-13 22:11:13,757 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-01-13 22:11:13,757 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-01-13 22:11:13,757 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-01-13 22:11:13,757 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-01-13 22:11:13,757 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-01-13 22:11:13,757 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-01-13 22:11:13,758 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-01-13 22:11:13,759 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-01-13 22:11:13,759 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-01-13 22:11:13,759 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-01-13 22:11:13,759 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-01-13 22:11:13,759 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-01-13 22:11:13,760 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-01-13 22:11:13,760 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-01-13 22:11:13,761 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-01-13 22:11:13,761 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-01-13 22:11:13,761 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-01-13 22:11:13,761 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-01-13 22:11:13,761 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-01-13 22:11:13,761 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-01-13 22:11:13,762 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-01-13 22:11:13,762 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-01-13 22:11:13,763 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-01-13 22:11:13,763 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-01-13 22:11:13,763 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-01-13 22:11:13,763 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-01-13 22:11:13,763 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-01-13 22:11:13,763 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-01-13 22:11:13,763 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-01-13 22:11:13,764 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-01-13 22:11:13,765 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-01-13 22:11:13,765 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-01-13 22:11:13,765 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-01-13 22:11:13,765 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-01-13 22:11:13,765 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-01-13 22:11:13,765 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-01-13 22:11:13,765 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-01-13 22:11:13,766 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-01-13 22:11:13,766 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-01-13 22:11:13,767 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-01-13 22:11:13,767 INFO L130 BoogieDeclarations]: Found specification of procedure __secure_getenv [2019-01-13 22:11:13,767 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-01-13 22:11:13,767 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-01-13 22:11:13,767 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-01-13 22:11:13,767 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-01-13 22:11:13,767 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-01-13 22:11:13,767 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-01-13 22:11:13,768 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-01-13 22:11:13,768 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-01-13 22:11:13,768 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-01-13 22:11:13,768 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-01-13 22:11:13,768 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-01-13 22:11:13,768 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-01-13 22:11:13,768 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-01-13 22:11:13,768 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-01-13 22:11:13,769 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-01-13 22:11:13,770 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-01-13 22:11:13,771 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-01-13 22:11:13,771 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-01-13 22:11:13,771 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-01-13 22:11:13,771 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-01-13 22:11:13,771 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-01-13 22:11:13,772 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-01-13 22:11:13,772 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-01-13 22:11:13,772 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-01-13 22:11:13,772 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-01-13 22:11:13,772 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-01-13 22:11:13,772 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-01-13 22:11:13,772 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-01-13 22:11:13,772 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-01-13 22:11:13,773 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-01-13 22:11:13,773 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-01-13 22:11:13,773 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-01-13 22:11:13,773 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-01-13 22:11:13,773 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-01-13 22:11:13,773 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-01-13 22:11:13,773 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-01-13 22:11:13,773 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-01-13 22:11:13,774 INFO L130 BoogieDeclarations]: Found specification of procedure append [2019-01-13 22:11:13,776 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-13 22:11:13,776 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-01-13 22:11:13,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-01-13 22:11:13,776 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-13 22:11:13,776 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-13 22:11:13,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-01-13 22:11:13,776 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-13 22:11:13,777 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-01-13 22:11:13,778 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-13 22:11:13,778 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.setCurrentRoundingMode [2019-01-13 22:11:14,773 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-13 22:11:14,773 INFO L286 CfgBuilder]: Removed 2 assue(true) statements. [2019-01-13 22:11:14,775 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 10:11:14 BoogieIcfgContainer [2019-01-13 22:11:14,775 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-13 22:11:14,776 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-13 22:11:14,776 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-13 22:11:14,779 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-13 22:11:14,780 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.01 10:11:12" (1/3) ... [2019-01-13 22:11:14,780 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c8aacbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 10:11:14, skipping insertion in model container [2019-01-13 22:11:14,780 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:11:13" (2/3) ... [2019-01-13 22:11:14,782 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c8aacbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 10:11:14, skipping insertion in model container [2019-01-13 22:11:14,782 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 10:11:14" (3/3) ... [2019-01-13 22:11:14,783 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0232_false-valid-memtrack.i [2019-01-13 22:11:14,794 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-13 22:11:14,802 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 41 error locations. [2019-01-13 22:11:14,819 INFO L257 AbstractCegarLoop]: Starting to check reachability of 41 error locations. [2019-01-13 22:11:14,855 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-13 22:11:14,855 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-13 22:11:14,856 INFO L383 AbstractCegarLoop]: Hoare is false [2019-01-13 22:11:14,856 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-13 22:11:14,857 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-13 22:11:14,857 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-13 22:11:14,857 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-13 22:11:14,857 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-13 22:11:14,857 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-13 22:11:14,875 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states. [2019-01-13 22:11:14,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-13 22:11:14,884 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:11:14,885 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:11:14,887 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION]=== [2019-01-13 22:11:14,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:11:14,894 INFO L82 PathProgramCache]: Analyzing trace with hash 1818457071, now seen corresponding path program 1 times [2019-01-13 22:11:14,899 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-13 22:11:14,899 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-13 22:11:14,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:11:14,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:11:14,978 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 22:11:14,999 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-13 22:11:14,999 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-13 22:11:15,005 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:11:15,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-13 22:11:15,011 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-01-13 22:11:15,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-13 22:11:15,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-13 22:11:15,030 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 2 states. [2019-01-13 22:11:15,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:11:15,063 INFO L93 Difference]: Finished difference Result 88 states and 91 transitions. [2019-01-13 22:11:15,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-13 22:11:15,065 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 8 [2019-01-13 22:11:15,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:11:15,078 INFO L225 Difference]: With dead ends: 88 [2019-01-13 22:11:15,079 INFO L226 Difference]: Without dead ends: 85 [2019-01-13 22:11:15,081 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-13 22:11:15,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-01-13 22:11:15,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-01-13 22:11:15,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-01-13 22:11:15,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 88 transitions. [2019-01-13 22:11:15,132 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 88 transitions. Word has length 8 [2019-01-13 22:11:15,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:11:15,133 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 88 transitions. [2019-01-13 22:11:15,133 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-01-13 22:11:15,133 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 88 transitions. [2019-01-13 22:11:15,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-13 22:11:15,134 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:11:15,135 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:11:15,135 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION]=== [2019-01-13 22:11:15,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:11:15,137 INFO L82 PathProgramCache]: Analyzing trace with hash 537693552, now seen corresponding path program 1 times [2019-01-13 22:11:15,137 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-13 22:11:15,137 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-13 22:11:15,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:11:15,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:11:15,195 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 22:11:15,229 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-13 22:11:15,231 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 22:11:15,238 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:11:15,238 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-01-13 22:11:15,343 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:11:15,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:11:15,350 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-13 22:11:15,351 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 22:11:15,363 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-13 22:11:15,364 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2019-01-13 22:11:15,430 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-13 22:11:15,431 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-13 22:11:15,433 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:11:15,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 22:11:15,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 22:11:15,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 22:11:15,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 22:11:15,436 INFO L87 Difference]: Start difference. First operand 85 states and 88 transitions. Second operand 5 states. [2019-01-13 22:11:16,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:11:16,333 INFO L93 Difference]: Finished difference Result 77 states and 80 transitions. [2019-01-13 22:11:16,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 22:11:16,335 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-01-13 22:11:16,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:11:16,337 INFO L225 Difference]: With dead ends: 77 [2019-01-13 22:11:16,337 INFO L226 Difference]: Without dead ends: 77 [2019-01-13 22:11:16,338 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-13 22:11:16,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-01-13 22:11:16,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-01-13 22:11:16,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-01-13 22:11:16,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 80 transitions. [2019-01-13 22:11:16,348 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 80 transitions. Word has length 9 [2019-01-13 22:11:16,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:11:16,348 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 80 transitions. [2019-01-13 22:11:16,348 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 22:11:16,349 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 80 transitions. [2019-01-13 22:11:16,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-13 22:11:16,349 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:11:16,349 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:11:16,350 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION]=== [2019-01-13 22:11:16,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:11:16,350 INFO L82 PathProgramCache]: Analyzing trace with hash 537693553, now seen corresponding path program 1 times [2019-01-13 22:11:16,351 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-13 22:11:16,353 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-13 22:11:16,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:11:16,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:11:16,414 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 22:11:16,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 6 treesize of output 5 [2019-01-13 22:11:16,421 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 22:11:16,442 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-13 22:11:16,442 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:11:16,452 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:11:16,453 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-01-13 22:11:16,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:11:16,506 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:11:16,508 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-13 22:11:16,509 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 22:11:16,582 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:11:16,584 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:11:16,585 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-13 22:11:16,586 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:11:16,598 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-13 22:11:16,599 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:14 [2019-01-13 22:11:16,621 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-13 22:11:16,622 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-13 22:11:16,627 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:11:16,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 22:11:16,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 22:11:16,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 22:11:16,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 22:11:16,628 INFO L87 Difference]: Start difference. First operand 77 states and 80 transitions. Second operand 5 states. [2019-01-13 22:11:17,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:11:17,343 INFO L93 Difference]: Finished difference Result 95 states and 99 transitions. [2019-01-13 22:11:17,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 22:11:17,344 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-01-13 22:11:17,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:11:17,347 INFO L225 Difference]: With dead ends: 95 [2019-01-13 22:11:17,347 INFO L226 Difference]: Without dead ends: 95 [2019-01-13 22:11:17,348 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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-13 22:11:17,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-01-13 22:11:17,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 82. [2019-01-13 22:11:17,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-01-13 22:11:17,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 90 transitions. [2019-01-13 22:11:17,363 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 90 transitions. Word has length 9 [2019-01-13 22:11:17,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:11:17,363 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 90 transitions. [2019-01-13 22:11:17,364 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 22:11:17,365 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 90 transitions. [2019-01-13 22:11:17,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-13 22:11:17,366 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:11:17,366 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:11:17,366 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION]=== [2019-01-13 22:11:17,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:11:17,367 INFO L82 PathProgramCache]: Analyzing trace with hash -511369007, now seen corresponding path program 1 times [2019-01-13 22:11:17,367 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-13 22:11:17,367 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-13 22:11:17,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:11:17,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:11:17,429 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 22:11:17,445 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-13 22:11:17,446 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 22:11:17,456 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:11:17,457 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-01-13 22:11:17,472 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-13 22:11:17,474 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-13 22:11:17,481 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:11:17,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-13 22:11:17,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 22:11:17,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 22:11:17,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 22:11:17,482 INFO L87 Difference]: Start difference. First operand 82 states and 90 transitions. Second operand 3 states. [2019-01-13 22:11:17,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:11:17,692 INFO L93 Difference]: Finished difference Result 78 states and 85 transitions. [2019-01-13 22:11:17,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 22:11:17,693 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-01-13 22:11:17,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:11:17,694 INFO L225 Difference]: With dead ends: 78 [2019-01-13 22:11:17,694 INFO L226 Difference]: Without dead ends: 78 [2019-01-13 22:11:17,694 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-13 22:11:17,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-01-13 22:11:17,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-01-13 22:11:17,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-01-13 22:11:17,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 85 transitions. [2019-01-13 22:11:17,703 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 85 transitions. Word has length 10 [2019-01-13 22:11:17,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:11:17,703 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 85 transitions. [2019-01-13 22:11:17,703 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 22:11:17,703 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 85 transitions. [2019-01-13 22:11:17,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-13 22:11:17,704 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:11:17,704 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:11:17,704 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION]=== [2019-01-13 22:11:17,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:11:17,707 INFO L82 PathProgramCache]: Analyzing trace with hash -511369008, now seen corresponding path program 1 times [2019-01-13 22:11:17,707 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-13 22:11:17,707 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-13 22:11:17,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:11:17,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:11:17,771 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 22:11:17,785 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-13 22:11:17,785 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 22:11:17,810 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:11:17,811 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-01-13 22:11:17,895 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-13 22:11:17,895 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-13 22:11:17,897 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:11:17,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-13 22:11:17,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 22:11:17,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 22:11:17,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 22:11:17,898 INFO L87 Difference]: Start difference. First operand 78 states and 85 transitions. Second operand 3 states. [2019-01-13 22:11:18,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:11:18,006 INFO L93 Difference]: Finished difference Result 74 states and 80 transitions. [2019-01-13 22:11:18,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 22:11:18,006 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-01-13 22:11:18,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:11:18,007 INFO L225 Difference]: With dead ends: 74 [2019-01-13 22:11:18,008 INFO L226 Difference]: Without dead ends: 74 [2019-01-13 22:11:18,008 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-13 22:11:18,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-01-13 22:11:18,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-01-13 22:11:18,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-01-13 22:11:18,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 80 transitions. [2019-01-13 22:11:18,015 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 80 transitions. Word has length 10 [2019-01-13 22:11:18,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:11:18,016 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 80 transitions. [2019-01-13 22:11:18,016 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 22:11:18,016 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2019-01-13 22:11:18,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-13 22:11:18,017 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:11:18,017 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:11:18,017 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION]=== [2019-01-13 22:11:18,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:11:18,018 INFO L82 PathProgramCache]: Analyzing trace with hash 1265568891, now seen corresponding path program 1 times [2019-01-13 22:11:18,020 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-13 22:11:18,020 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-13 22:11:18,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:11:18,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:11:18,096 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 22:11:18,280 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-13 22:11:18,288 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-13 22:11:18,290 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:11:18,349 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:11:18,444 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-13 22:11:18,464 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-13 22:11:18,465 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-13 22:11:18,525 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-13 22:11:18,526 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-13 22:11:18,545 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:11:18,561 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-13 22:11:18,561 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:45, output treesize:37 [2019-01-13 22:11:18,732 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-13 22:11:18,741 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-13 22:11:18,742 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:11:18,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 15 treesize of output 8 [2019-01-13 22:11:18,777 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-13 22:11:18,805 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-13 22:11:18,805 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-13 22:11:18,815 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:11:18,879 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-13 22:11:18,887 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-13 22:11:18,888 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-13 22:11:18,920 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-13 22:11:18,921 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-13 22:11:18,943 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-13 22:11:18,943 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-13 22:11:18,951 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:11:18,957 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-13 22:11:18,958 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:51, output treesize:7 [2019-01-13 22:11:18,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 22:11:18,981 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-13 22:11:18,984 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:11:18,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-13 22:11:18,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-13 22:11:18,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-13 22:11:18,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=39, Unknown=4, NotChecked=0, Total=56 [2019-01-13 22:11:18,985 INFO L87 Difference]: Start difference. First operand 74 states and 80 transitions. Second operand 8 states. [2019-01-13 22:11:19,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:11:19,807 INFO L93 Difference]: Finished difference Result 82 states and 89 transitions. [2019-01-13 22:11:19,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-13 22:11:19,812 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2019-01-13 22:11:19,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:11:19,813 INFO L225 Difference]: With dead ends: 82 [2019-01-13 22:11:19,813 INFO L226 Difference]: Without dead ends: 82 [2019-01-13 22:11:19,813 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=46, Invalid=96, Unknown=14, NotChecked=0, Total=156 [2019-01-13 22:11:19,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-01-13 22:11:19,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2019-01-13 22:11:19,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-01-13 22:11:19,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 88 transitions. [2019-01-13 22:11:19,822 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 88 transitions. Word has length 15 [2019-01-13 22:11:19,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:11:19,822 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 88 transitions. [2019-01-13 22:11:19,823 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-13 22:11:19,823 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 88 transitions. [2019-01-13 22:11:19,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-13 22:11:19,824 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:11:19,824 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:11:19,825 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION]=== [2019-01-13 22:11:19,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:11:19,825 INFO L82 PathProgramCache]: Analyzing trace with hash 578208085, now seen corresponding path program 1 times [2019-01-13 22:11:19,826 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-13 22:11:19,826 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-13 22:11:19,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:11:19,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:11:19,926 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 22:11:20,154 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 14 [2019-01-13 22:11:20,165 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:11:20,168 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2019-01-13 22:11:20,169 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 22:11:20,197 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:11:20,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:11:20,200 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-13 22:11:20,200 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:11:20,214 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-13 22:11:20,214 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:20 [2019-01-13 22:11:20,247 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-13 22:11:20,248 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-13 22:11:20,251 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:11:20,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 22:11:20,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 22:11:20,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 22:11:20,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-13 22:11:20,252 INFO L87 Difference]: Start difference. First operand 81 states and 88 transitions. Second operand 7 states. [2019-01-13 22:11:22,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:11:22,749 INFO L93 Difference]: Finished difference Result 82 states and 89 transitions. [2019-01-13 22:11:22,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 22:11:22,750 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2019-01-13 22:11:22,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:11:22,752 INFO L225 Difference]: With dead ends: 82 [2019-01-13 22:11:22,752 INFO L226 Difference]: Without dead ends: 82 [2019-01-13 22:11:22,753 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-13 22:11:22,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-01-13 22:11:22,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2019-01-13 22:11:22,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-01-13 22:11:22,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 89 transitions. [2019-01-13 22:11:22,762 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 89 transitions. Word has length 16 [2019-01-13 22:11:22,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:11:22,762 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 89 transitions. [2019-01-13 22:11:22,762 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 22:11:22,762 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 89 transitions. [2019-01-13 22:11:22,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-13 22:11:22,764 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:11:22,764 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] [2019-01-13 22:11:22,764 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION]=== [2019-01-13 22:11:22,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:11:22,764 INFO L82 PathProgramCache]: Analyzing trace with hash -1857015227, now seen corresponding path program 1 times [2019-01-13 22:11:22,766 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-13 22:11:22,766 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-13 22:11:22,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:11:22,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:11:22,879 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 22:11:22,905 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-13 22:11:22,906 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 22:11:22,912 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:11:22,913 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:7 [2019-01-13 22:11:22,945 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-13 22:11:22,963 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-13 22:11:22,964 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:11:22,967 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:11:22,974 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-13 22:11:22,974 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2019-01-13 22:11:23,027 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-13 22:11:23,042 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-13 22:11:23,043 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:11:23,047 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:11:23,050 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-13 22:11:23,050 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:7 [2019-01-13 22:11:23,061 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-13 22:11:23,061 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-13 22:11:23,064 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:11:23,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 22:11:23,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-13 22:11:23,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-13 22:11:23,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-01-13 22:11:23,065 INFO L87 Difference]: Start difference. First operand 82 states and 89 transitions. Second operand 8 states. [2019-01-13 22:11:23,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:11:23,905 INFO L93 Difference]: Finished difference Result 90 states and 95 transitions. [2019-01-13 22:11:23,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 22:11:23,905 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2019-01-13 22:11:23,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:11:23,907 INFO L225 Difference]: With dead ends: 90 [2019-01-13 22:11:23,907 INFO L226 Difference]: Without dead ends: 90 [2019-01-13 22:11:23,908 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-01-13 22:11:23,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-01-13 22:11:23,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 81. [2019-01-13 22:11:23,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-01-13 22:11:23,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 88 transitions. [2019-01-13 22:11:23,914 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 88 transitions. Word has length 23 [2019-01-13 22:11:23,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:11:23,914 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 88 transitions. [2019-01-13 22:11:23,914 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-13 22:11:23,915 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 88 transitions. [2019-01-13 22:11:23,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-13 22:11:23,917 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:11:23,917 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] [2019-01-13 22:11:23,917 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION]=== [2019-01-13 22:11:23,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:11:23,918 INFO L82 PathProgramCache]: Analyzing trace with hash -1857015226, now seen corresponding path program 1 times [2019-01-13 22:11:23,918 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-13 22:11:23,918 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-13 22:11:23,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:11:24,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:11:24,024 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 22:11:24,109 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-13 22:11:24,114 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-13 22:11:24,115 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:11:24,119 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:11:24,143 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-13 22:11:24,150 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-13 22:11:24,150 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-13 22:11:24,153 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:11:24,167 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-13 22:11:24,168 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:28, output treesize:17 [2019-01-13 22:11:24,223 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-13 22:11:24,230 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-13 22:11:24,231 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:11:24,234 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:11:24,250 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-13 22:11:24,252 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-13 22:11:24,253 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-13 22:11:24,256 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:11:24,263 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-13 22:11:24,263 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:31, output treesize:9 [2019-01-13 22:11:24,287 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-13 22:11:24,288 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-13 22:11:24,296 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:11:24,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 22:11:24,296 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-13 22:11:24,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-13 22:11:24,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-01-13 22:11:24,297 INFO L87 Difference]: Start difference. First operand 81 states and 88 transitions. Second operand 8 states. [2019-01-13 22:11:24,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:11:24,940 INFO L93 Difference]: Finished difference Result 92 states and 97 transitions. [2019-01-13 22:11:24,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 22:11:24,941 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2019-01-13 22:11:24,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:11:24,942 INFO L225 Difference]: With dead ends: 92 [2019-01-13 22:11:24,942 INFO L226 Difference]: Without dead ends: 92 [2019-01-13 22:11:24,942 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-01-13 22:11:24,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-01-13 22:11:24,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 80. [2019-01-13 22:11:24,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-01-13 22:11:24,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 87 transitions. [2019-01-13 22:11:24,949 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 87 transitions. Word has length 23 [2019-01-13 22:11:24,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:11:24,949 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 87 transitions. [2019-01-13 22:11:24,951 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-13 22:11:24,951 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 87 transitions. [2019-01-13 22:11:24,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-01-13 22:11:24,952 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:11:24,952 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-13 22:11:24,952 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION]=== [2019-01-13 22:11:24,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:11:24,953 INFO L82 PathProgramCache]: Analyzing trace with hash 2134928381, now seen corresponding path program 1 times [2019-01-13 22:11:24,955 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-13 22:11:24,955 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-13 22:11:24,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:11:25,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:11:25,055 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 22:11:25,089 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-13 22:11:25,095 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-13 22:11:25,095 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:11:25,100 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:11:25,107 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-13 22:11:25,107 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:8 [2019-01-13 22:11:25,139 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-13 22:11:25,142 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-13 22:11:25,142 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:11:25,144 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:11:25,145 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-13 22:11:25,146 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:4 [2019-01-13 22:11:25,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-13 22:11:25,158 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-13 22:11:25,166 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:11:25,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 22:11:25,167 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 22:11:25,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 22:11:25,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-13 22:11:25,167 INFO L87 Difference]: Start difference. First operand 80 states and 87 transitions. Second operand 7 states. [2019-01-13 22:11:25,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:11:25,556 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2019-01-13 22:11:25,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 22:11:25,557 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2019-01-13 22:11:25,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:11:25,558 INFO L225 Difference]: With dead ends: 74 [2019-01-13 22:11:25,559 INFO L226 Difference]: Without dead ends: 74 [2019-01-13 22:11:25,559 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-01-13 22:11:25,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-01-13 22:11:25,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-01-13 22:11:25,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-01-13 22:11:25,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 77 transitions. [2019-01-13 22:11:25,564 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 77 transitions. Word has length 25 [2019-01-13 22:11:25,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:11:25,564 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 77 transitions. [2019-01-13 22:11:25,564 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 22:11:25,565 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2019-01-13 22:11:25,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-13 22:11:25,567 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:11:25,567 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] [2019-01-13 22:11:25,568 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION]=== [2019-01-13 22:11:25,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:11:25,568 INFO L82 PathProgramCache]: Analyzing trace with hash 1133117218, now seen corresponding path program 1 times [2019-01-13 22:11:25,568 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-13 22:11:25,568 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-13 22:11:25,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:11:25,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:11:25,684 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 22:11:25,861 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-13 22:11:25,865 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-13 22:11:25,866 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:11:25,870 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:11:25,873 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:11:25,873 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2019-01-13 22:11:25,917 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-13 22:11:25,923 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-13 22:11:25,924 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:11:25,929 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:11:25,932 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-13 22:11:25,932 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-01-13 22:11:25,961 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-13 22:11:25,961 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-13 22:11:25,965 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:11:25,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 22:11:25,965 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 22:11:25,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 22:11:25,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-13 22:11:25,966 INFO L87 Difference]: Start difference. First operand 74 states and 77 transitions. Second operand 7 states. [2019-01-13 22:11:26,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:11:26,339 INFO L93 Difference]: Finished difference Result 73 states and 76 transitions. [2019-01-13 22:11:26,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 22:11:26,340 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2019-01-13 22:11:26,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:11:26,341 INFO L225 Difference]: With dead ends: 73 [2019-01-13 22:11:26,341 INFO L226 Difference]: Without dead ends: 73 [2019-01-13 22:11:26,341 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-01-13 22:11:26,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-01-13 22:11:26,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-01-13 22:11:26,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-01-13 22:11:26,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 76 transitions. [2019-01-13 22:11:26,347 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 76 transitions. Word has length 26 [2019-01-13 22:11:26,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:11:26,347 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 76 transitions. [2019-01-13 22:11:26,347 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 22:11:26,347 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 76 transitions. [2019-01-13 22:11:26,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-13 22:11:26,350 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:11:26,350 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-13 22:11:26,350 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION]=== [2019-01-13 22:11:26,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:11:26,351 INFO L82 PathProgramCache]: Analyzing trace with hash 766895462, now seen corresponding path program 1 times [2019-01-13 22:11:26,351 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-13 22:11:26,351 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-13 22:11:26,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:11:26,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:11:26,496 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 22:11:26,576 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-13 22:11:26,581 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-13 22:11:26,581 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:11:26,585 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:11:26,594 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-13 22:11:26,595 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:7 [2019-01-13 22:11:26,629 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-13 22:11:26,632 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-13 22:11:26,632 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:11:26,636 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:11:26,639 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-13 22:11:26,640 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-01-13 22:11:26,653 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-13 22:11:26,653 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-13 22:11:26,656 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:11:26,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 22:11:26,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 22:11:26,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 22:11:26,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-13 22:11:26,657 INFO L87 Difference]: Start difference. First operand 73 states and 76 transitions. Second operand 7 states. [2019-01-13 22:11:27,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:11:27,100 INFO L93 Difference]: Finished difference Result 72 states and 75 transitions. [2019-01-13 22:11:27,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 22:11:27,101 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2019-01-13 22:11:27,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:11:27,103 INFO L225 Difference]: With dead ends: 72 [2019-01-13 22:11:27,104 INFO L226 Difference]: Without dead ends: 72 [2019-01-13 22:11:27,104 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-13 22:11:27,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-01-13 22:11:27,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-01-13 22:11:27,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-01-13 22:11:27,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 75 transitions. [2019-01-13 22:11:27,110 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 75 transitions. Word has length 27 [2019-01-13 22:11:27,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:11:27,110 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 75 transitions. [2019-01-13 22:11:27,110 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 22:11:27,111 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 75 transitions. [2019-01-13 22:11:27,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-01-13 22:11:27,113 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:11:27,113 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] [2019-01-13 22:11:27,113 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION]=== [2019-01-13 22:11:27,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:11:27,114 INFO L82 PathProgramCache]: Analyzing trace with hash 766450185, now seen corresponding path program 1 times [2019-01-13 22:11:27,114 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-13 22:11:27,114 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-13 22:11:27,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:11:27,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:11:27,278 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 22:11:27,308 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-13 22:11:27,309 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 22:11:27,316 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:11:27,317 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:7 [2019-01-13 22:11:27,350 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-13 22:11:27,354 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-13 22:11:27,355 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:11:27,359 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:11:27,368 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-13 22:11:27,368 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2019-01-13 22:11:27,439 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-13 22:11:27,440 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 22:11:27,464 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:11:27,465 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:18 [2019-01-13 22:11:27,564 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-13 22:11:27,571 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-13 22:11:27,572 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:11:27,617 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:11:27,631 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-13 22:11:27,632 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:28 [2019-01-13 22:11:27,718 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-13 22:11:27,729 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-13 22:11:27,730 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:11:27,760 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 12 [2019-01-13 22:11:27,760 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-13 22:11:27,821 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-13 22:11:27,821 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-13 22:11:27,828 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:11:27,833 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-13 22:11:27,833 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:35, output treesize:13 [2019-01-13 22:11:27,864 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-13 22:11:27,864 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-13 22:11:28,221 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-13 22:11:28,225 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-13 22:11:28,225 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-13 22:11:28,229 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-13 22:11:28,259 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-13 22:11:28,260 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:50 [2019-01-13 22:11:28,381 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 17 treesize of output 12 [2019-01-13 22:11:28,382 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 22:11:28,423 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 17 treesize of output 12 [2019-01-13 22:11:28,423 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:11:28,461 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-13 22:11:28,462 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:35, output treesize:7 [2019-01-13 22:11:28,472 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-13 22:11:28,472 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 22:11:28,474 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-13 22:11:28,475 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:11:28,489 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-13 22:11:28,489 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:7 [2019-01-13 22:11:28,496 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-13 22:11:28,498 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 22:11:28,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 16 [2019-01-13 22:11:28,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-13 22:11:28,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-13 22:11:28,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2019-01-13 22:11:28,499 INFO L87 Difference]: Start difference. First operand 72 states and 75 transitions. Second operand 17 states. [2019-01-13 22:11:30,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:11:30,495 INFO L93 Difference]: Finished difference Result 76 states and 78 transitions. [2019-01-13 22:11:30,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-13 22:11:30,496 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 28 [2019-01-13 22:11:30,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:11:30,498 INFO L225 Difference]: With dead ends: 76 [2019-01-13 22:11:30,498 INFO L226 Difference]: Without dead ends: 76 [2019-01-13 22:11:30,499 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=145, Invalid=505, Unknown=0, NotChecked=0, Total=650 [2019-01-13 22:11:30,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-01-13 22:11:30,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 71. [2019-01-13 22:11:30,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-01-13 22:11:30,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 73 transitions. [2019-01-13 22:11:30,502 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 73 transitions. Word has length 28 [2019-01-13 22:11:30,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:11:30,502 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 73 transitions. [2019-01-13 22:11:30,502 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-13 22:11:30,503 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 73 transitions. [2019-01-13 22:11:30,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-01-13 22:11:30,506 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:11:30,506 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] [2019-01-13 22:11:30,506 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION]=== [2019-01-13 22:11:30,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:11:30,509 INFO L82 PathProgramCache]: Analyzing trace with hash 766450186, now seen corresponding path program 1 times [2019-01-13 22:11:30,509 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-13 22:11:30,509 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-13 22:11:30,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:11:30,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:11:30,687 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 22:11:30,700 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-13 22:11:30,701 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 22:11:30,725 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-13 22:11:30,725 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:11:30,744 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:11:30,744 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:20 [2019-01-13 22:11:30,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:11:30,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, 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-13 22:11:30,804 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 22:11:31,058 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:11:31,083 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:11:31,085 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-13 22:11:31,085 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:11:31,264 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-13 22:11:31,264 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:24 [2019-01-13 22:11:31,491 WARN L181 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2019-01-13 22:11:31,773 WARN L181 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2019-01-13 22:11:31,795 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-13 22:11:31,803 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-13 22:11:31,803 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:11:31,811 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:11:31,851 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-13 22:11:31,860 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-13 22:11:31,860 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-13 22:11:31,864 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:11:31,886 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-13 22:11:31,886 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:44, output treesize:43 [2019-01-13 22:11:32,075 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:11:32,079 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 23 treesize of output 36 [2019-01-13 22:11:32,080 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 22:11:32,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:11:32,113 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:11:32,114 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 17 treesize of output 8 [2019-01-13 22:11:32,115 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:11:32,138 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-13 22:11:32,139 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:57, output treesize:46 [2019-01-13 22:11:32,549 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-13 22:11:32,558 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-13 22:11:32,559 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:11:32,640 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:11:32,725 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 35 treesize of output 43 [2019-01-13 22:11:32,734 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 29 treesize of output 29 [2019-01-13 22:11:32,735 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-13 22:11:32,806 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 32 treesize of output 31 [2019-01-13 22:11:32,806 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-13 22:11:32,839 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:11:32,861 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-13 22:11:32,862 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:62, output treesize:54 [2019-01-13 22:11:33,012 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-13 22:11:33,017 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-13 22:11:33,018 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:11:33,059 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-13 22:11:33,059 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-13 22:11:33,077 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:11:33,123 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 38 treesize of output 36 [2019-01-13 22:11:33,129 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 32 treesize of output 25 [2019-01-13 22:11:33,129 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-13 22:11:33,174 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 25 treesize of output 16 [2019-01-13 22:11:33,175 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-13 22:11:33,216 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-13 22:11:33,217 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-13 22:11:33,235 INFO L267 ElimStorePlain]: Start of recursive call 5: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:11:33,246 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-13 22:11:33,246 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:68, output treesize:18 [2019-01-13 22:11:33,296 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-13 22:11:33,297 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-13 22:11:35,103 WARN L181 SmtUtils]: Spent 511.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2019-01-13 22:11:35,111 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-13 22:11:35,114 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-13 22:11:35,116 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:11:35,123 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:11:35,132 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-13 22:11:35,141 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-13 22:11:35,144 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-13 22:11:35,158 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:11:35,163 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-13 22:11:35,171 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-13 22:11:35,173 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-13 22:11:35,177 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:11:35,427 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-13 22:11:35,431 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2019-01-13 22:11:35,433 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-13 22:11:35,439 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:11:35,443 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-13 22:11:35,447 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-13 22:11:35,448 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-13 22:11:35,454 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:11:35,648 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-13 22:11:35,654 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-13 22:11:35,655 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-13 22:11:35,676 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-13 22:11:35,681 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-13 22:11:35,687 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-13 22:11:35,688 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-13 22:11:35,706 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-13 22:11:35,904 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-13 22:11:35,910 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-13 22:11:35,910 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-13 22:11:35,933 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-13 22:11:35,937 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-13 22:11:35,941 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-13 22:11:35,941 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-13 22:11:35,957 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-13 22:11:36,184 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-13 22:11:36,185 INFO L202 ElimStorePlain]: Needed 19 recursive calls to eliminate 7 variables, input treesize:104, output treesize:132 [2019-01-13 22:11:36,664 WARN L181 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 52 [2019-01-13 22:11:36,676 INFO L683 Elim1Store]: detected equality via solver [2019-01-13 22:11:36,676 INFO L683 Elim1Store]: detected equality via solver [2019-01-13 22:11:36,677 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-13 22:11:36,678 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 22:11:36,772 INFO L683 Elim1Store]: detected equality via solver [2019-01-13 22:11:36,773 INFO L683 Elim1Store]: detected equality via solver [2019-01-13 22:11:36,774 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-13 22:11:36,775 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:11:36,866 INFO L683 Elim1Store]: detected equality via solver [2019-01-13 22:11:36,867 INFO L683 Elim1Store]: detected equality via solver [2019-01-13 22:11:36,868 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-13 22:11:36,868 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-13 22:11:36,959 INFO L683 Elim1Store]: detected equality via solver [2019-01-13 22:11:36,960 INFO L683 Elim1Store]: detected equality via solver [2019-01-13 22:11:36,962 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-13 22:11:36,962 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-13 22:11:37,048 INFO L683 Elim1Store]: detected equality via solver [2019-01-13 22:11:37,049 INFO L683 Elim1Store]: detected equality via solver [2019-01-13 22:11:37,050 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-13 22:11:37,051 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-13 22:11:37,127 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 5 dim-1 vars, End of recursive call: 1 dim-0 vars, and 5 xjuncts. [2019-01-13 22:11:37,128 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 10 variables, input treesize:94, output treesize:33 [2019-01-13 22:11:37,749 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-13 22:11:37,751 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 22:11:37,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 20 [2019-01-13 22:11:37,752 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-01-13 22:11:37,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-01-13 22:11:37,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2019-01-13 22:11:37,753 INFO L87 Difference]: Start difference. First operand 71 states and 73 transitions. Second operand 21 states. [2019-01-13 22:11:39,550 WARN L181 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 53 [2019-01-13 22:11:39,876 WARN L181 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 56 [2019-01-13 22:11:40,116 WARN L181 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 50 [2019-01-13 22:11:40,596 WARN L181 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 56 [2019-01-13 22:11:43,456 WARN L181 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 55 [2019-01-13 22:11:44,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:11:44,285 INFO L93 Difference]: Finished difference Result 72 states and 74 transitions. [2019-01-13 22:11:44,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-13 22:11:44,288 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 28 [2019-01-13 22:11:44,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:11:44,289 INFO L225 Difference]: With dead ends: 72 [2019-01-13 22:11:44,289 INFO L226 Difference]: Without dead ends: 72 [2019-01-13 22:11:44,290 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=159, Invalid=653, Unknown=0, NotChecked=0, Total=812 [2019-01-13 22:11:44,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-01-13 22:11:44,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2019-01-13 22:11:44,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-01-13 22:11:44,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 72 transitions. [2019-01-13 22:11:44,297 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 72 transitions. Word has length 28 [2019-01-13 22:11:44,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:11:44,298 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 72 transitions. [2019-01-13 22:11:44,298 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-01-13 22:11:44,298 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 72 transitions. [2019-01-13 22:11:44,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-01-13 22:11:44,301 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:11:44,301 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-13 22:11:44,302 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION]=== [2019-01-13 22:11:44,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:11:44,303 INFO L82 PathProgramCache]: Analyzing trace with hash -1996044380, now seen corresponding path program 1 times [2019-01-13 22:11:44,303 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-13 22:11:44,303 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-13 22:11:44,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:11:44,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:11:44,419 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 22:11:44,435 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-13 22:11:44,435 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 22:11:44,447 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:11:44,448 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:7 [2019-01-13 22:11:44,474 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-13 22:11:44,478 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-13 22:11:44,478 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:11:44,481 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:11:44,490 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-13 22:11:44,490 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2019-01-13 22:11:44,524 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-13 22:11:44,527 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-13 22:11:44,528 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:11:44,530 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:11:44,532 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-13 22:11:44,533 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:7 [2019-01-13 22:11:44,546 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-13 22:11:44,547 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-13 22:11:44,549 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:11:44,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 22:11:44,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-13 22:11:44,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-13 22:11:44,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-01-13 22:11:44,550 INFO L87 Difference]: Start difference. First operand 70 states and 72 transitions. Second operand 8 states. [2019-01-13 22:11:44,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:11:44,951 INFO L93 Difference]: Finished difference Result 69 states and 71 transitions. [2019-01-13 22:11:44,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 22:11:44,953 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2019-01-13 22:11:44,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:11:44,957 INFO L225 Difference]: With dead ends: 69 [2019-01-13 22:11:44,958 INFO L226 Difference]: Without dead ends: 69 [2019-01-13 22:11:44,958 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 21 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-13 22:11:44,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-01-13 22:11:44,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-01-13 22:11:44,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-01-13 22:11:44,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 71 transitions. [2019-01-13 22:11:44,961 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 71 transitions. Word has length 28 [2019-01-13 22:11:44,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:11:44,963 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 71 transitions. [2019-01-13 22:11:44,963 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-13 22:11:44,964 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 71 transitions. [2019-01-13 22:11:44,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-01-13 22:11:44,964 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:11:44,965 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-13 22:11:44,965 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION]=== [2019-01-13 22:11:44,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:11:44,965 INFO L82 PathProgramCache]: Analyzing trace with hash -1747833559, now seen corresponding path program 1 times [2019-01-13 22:11:44,965 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-13 22:11:44,966 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-13 22:11:44,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:11:45,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:11:45,136 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 22:11:45,142 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-13 22:11:45,142 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 22:11:45,150 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:11:45,151 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-01-13 22:11:45,192 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-13 22:11:45,192 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 22:11:45,201 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:11:45,201 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:12 [2019-01-13 22:11:45,209 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-13 22:11:45,213 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-13 22:11:45,213 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:11:45,216 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:11:45,224 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-13 22:11:45,225 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:17 [2019-01-13 22:11:45,244 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:11:45,246 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:11:45,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, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 8 [2019-01-13 22:11:45,247 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 22:11:45,254 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:11:45,254 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:17 [2019-01-13 22:11:45,284 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-13 22:11:45,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, 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-13 22:11:45,292 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:11:45,294 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:11:45,298 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:11:45,298 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:10 [2019-01-13 22:11:45,317 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:11:45,318 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-13 22:11:45,318 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 22:11:45,325 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-13 22:11:45,325 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:11 [2019-01-13 22:11:45,349 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-13 22:11:45,350 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-13 22:11:45,352 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:11:45,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-13 22:11:45,353 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-13 22:11:45,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-13 22:11:45,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-01-13 22:11:45,353 INFO L87 Difference]: Start difference. First operand 69 states and 71 transitions. Second operand 9 states. [2019-01-13 22:11:48,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:11:48,020 INFO L93 Difference]: Finished difference Result 86 states and 89 transitions. [2019-01-13 22:11:48,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-13 22:11:48,021 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2019-01-13 22:11:48,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:11:48,022 INFO L225 Difference]: With dead ends: 86 [2019-01-13 22:11:48,023 INFO L226 Difference]: Without dead ends: 86 [2019-01-13 22:11:48,023 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-01-13 22:11:48,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-01-13 22:11:48,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 68. [2019-01-13 22:11:48,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-01-13 22:11:48,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 70 transitions. [2019-01-13 22:11:48,026 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 70 transitions. Word has length 29 [2019-01-13 22:11:48,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:11:48,027 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 70 transitions. [2019-01-13 22:11:48,027 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-13 22:11:48,027 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 70 transitions. [2019-01-13 22:11:48,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-01-13 22:11:48,030 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:11:48,030 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-13 22:11:48,031 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION]=== [2019-01-13 22:11:48,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:11:48,031 INFO L82 PathProgramCache]: Analyzing trace with hash -1747833558, now seen corresponding path program 1 times [2019-01-13 22:11:48,031 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-13 22:11:48,032 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-13 22:11:48,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:11:48,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:11:48,105 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 22:11:48,129 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-13 22:11:48,129 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-13 22:11:48,131 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:11:48,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-13 22:11:48,132 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 22:11:48,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 22:11:48,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 22:11:48,132 INFO L87 Difference]: Start difference. First operand 68 states and 70 transitions. Second operand 3 states. [2019-01-13 22:11:48,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:11:48,281 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2019-01-13 22:11:48,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 22:11:48,282 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-01-13 22:11:48,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:11:48,283 INFO L225 Difference]: With dead ends: 63 [2019-01-13 22:11:48,283 INFO L226 Difference]: Without dead ends: 63 [2019-01-13 22:11:48,283 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 27 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-13 22:11:48,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-01-13 22:11:48,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-01-13 22:11:48,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-01-13 22:11:48,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 65 transitions. [2019-01-13 22:11:48,287 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 65 transitions. Word has length 29 [2019-01-13 22:11:48,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:11:48,288 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 65 transitions. [2019-01-13 22:11:48,288 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 22:11:48,290 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2019-01-13 22:11:48,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-01-13 22:11:48,291 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:11:48,291 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] [2019-01-13 22:11:48,291 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION]=== [2019-01-13 22:11:48,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:11:48,291 INFO L82 PathProgramCache]: Analyzing trace with hash -616510161, now seen corresponding path program 1 times [2019-01-13 22:11:48,292 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-13 22:11:48,292 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-13 22:11:48,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:11:48,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-13 22:11:48,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-13 22:11:48,702 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-13 22:11:48,722 WARN L416 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2019-01-13 22:11:48,746 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.01 10:11:48 BoogieIcfgContainer [2019-01-13 22:11:48,746 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-13 22:11:48,746 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-13 22:11:48,746 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-13 22:11:48,747 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-13 22:11:48,747 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 10:11:14" (3/4) ... [2019-01-13 22:11:48,755 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-13 22:11:48,755 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-13 22:11:48,757 INFO L168 Benchmark]: Toolchain (without parser) took 35795.68 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 308.8 MB). Free memory was 951.4 MB in the beginning and 978.8 MB in the end (delta: -27.4 MB). Peak memory consumption was 281.4 MB. Max. memory is 11.5 GB. [2019-01-13 22:11:48,757 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 22:11:48,758 INFO L168 Benchmark]: CACSL2BoogieTranslator took 636.08 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.5 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -185.5 MB). Peak memory consumption was 25.2 MB. Max. memory is 11.5 GB. [2019-01-13 22:11:48,758 INFO L168 Benchmark]: Boogie Preprocessor took 94.48 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-13 22:11:48,758 INFO L168 Benchmark]: RCFGBuilder took 1081.22 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: 58.3 MB). Peak memory consumption was 58.3 MB. Max. memory is 11.5 GB. [2019-01-13 22:11:48,759 INFO L168 Benchmark]: TraceAbstraction took 33969.98 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 157.3 MB). Free memory was 1.1 GB in the beginning and 978.8 MB in the end (delta: 94.4 MB). Peak memory consumption was 251.7 MB. Max. memory is 11.5 GB. [2019-01-13 22:11:48,762 INFO L168 Benchmark]: Witness Printer took 8.84 ms. Allocated memory is still 1.3 GB. Free memory is still 978.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 22:11:48,768 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 636.08 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.5 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -185.5 MB). Peak memory consumption was 25.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 94.48 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 1081.22 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: 58.3 MB). Peak memory consumption was 58.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 33969.98 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 157.3 MB). Free memory was 1.1 GB in the beginning and 978.8 MB in the end (delta: 94.4 MB). Peak memory consumption was 251.7 MB. Max. memory is 11.5 GB. * Witness Printer took 8.84 ms. Allocated memory is still 1.3 GB. Free memory is still 978.8 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: 633]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 633. Possible FailurePath: [L635] struct item *list = ((void *)0); VAL [list={-1142816753:0}] [L637] CALL append(&list) VAL [plist={-1142816753:0}] [L626] struct item *item = malloc(sizeof *item); VAL [item={1142816736:0}, malloc(sizeof *item)={1142816736:0}, plist={-1142816753:0}, plist={-1142816753:0}] [L627] EXPR \read(**plist) VAL [\read(**plist)={0:0}, item={1142816736:0}, malloc(sizeof *item)={1142816736:0}, plist={-1142816753:0}, plist={-1142816753:0}] [L627] item->next = *plist VAL [\read(**plist)={0:0}, item={1142816736:0}, malloc(sizeof *item)={1142816736:0}, plist={-1142816753:0}, plist={-1142816753:0}] [L628] EXPR item->next VAL [item={1142816736:0}, item->next={0:0}, malloc(sizeof *item)={1142816736:0}, plist={-1142816753:0}, plist={-1142816753:0}] [L628-L630] EXPR (item->next) ? item->next->data : malloc(sizeof *item) [L628-L630] EXPR (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={-605683697:0}, item={1142816736:0}, item->next={0:0}, malloc(sizeof *item)={-605683697:0}, malloc(sizeof *item)={1142816736:0}, plist={-1142816753:0}, plist={-1142816753:0}] [L628-L630] item->data = (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={-605683697:0}, item={1142816736:0}, item->next={0:0}, malloc(sizeof *item)={-605683697:0}, malloc(sizeof *item)={1142816736:0}, plist={-1142816753:0}, plist={-1142816753:0}] [L631] *plist = item VAL [item={1142816736:0}, malloc(sizeof *item)={-605683697:0}, malloc(sizeof *item)={1142816736:0}, plist={-1142816753:0}, plist={-1142816753:0}] [L637] RET append(&list) VAL [list={-1142816753:0}] [L638] COND FALSE !(__VERIFIER_nondet_int()) [L639] \read(*list) VAL [\read(*list)={1142816736:0}, list={-1142816753:0}] [L639] COND TRUE \read(*list) [L640] EXPR \read(*list) VAL [\read(*list)={1142816736:0}, list={-1142816753:0}] [L640] EXPR list->next VAL [\read(*list)={1142816736:0}, list={-1142816753:0}, list->next={0:0}] [L640] struct item *next = list->next; [L641] EXPR \read(*list) VAL [\read(*list)={1142816736:0}, list={-1142816753:0}, next={0:0}] [L641] free(list) VAL [\read(*list)={1142816736:0}, list={-1142816753:0}, next={0:0}] [L641] free(list) VAL [\read(*list)={1142816736:0}, list={-1142816753:0}, next={0:0}] [L641] free(list) [L642] list = next VAL [list={-1142816753:0}, next={0:0}] [L644] \read(*list) VAL [\read(*list)={0:0}, list={-1142816753:0}, next={0:0}] [L644] COND FALSE !(\read(*list)) [L649] return 0; [L635] struct item *list = ((void *)0); [L649] return 0; VAL [\result=0, next={0:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 91 locations, 41 error locations. UNSAFE Result, 33.9s OverallTime, 18 OverallIterations, 2 TraceHistogramMax, 19.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 778 SDtfs, 960 SDslu, 2132 SDs, 0 SdLazy, 2706 SolverSat, 135 SolverUnsat, 11 SolverUnknown, 0 SolverNotchecked, 15.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 425 GetRequests, 285 SyntacticMatches, 3 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 8.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=88occurred in iteration=0, 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, 17 MinimizatonAttempts, 60 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 11.5s InterpolantComputationTime, 376 NumberOfCodeBlocks, 376 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 380 ConstructedInterpolants, 44 QuantifiedInterpolants, 108957 SizeOfPredicates, 132 NumberOfNonLiveVariables, 1723 ConjunctsInSsa, 206 ConjunctsInUnsatCore, 19 InterpolantComputations, 15 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...