./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/forester-heap/dll-rb-sentinel-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_f986349c-add1-4cc4-8da0-7c80cbe320c6/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_f986349c-add1-4cc4-8da0-7c80cbe320c6/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_f986349c-add1-4cc4-8da0-7c80cbe320c6/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_f986349c-add1-4cc4-8da0-7c80cbe320c6/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/dll-rb-sentinel-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_f986349c-add1-4cc4-8da0-7c80cbe320c6/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_f986349c-add1-4cc4-8da0-7c80cbe320c6/bin/uautomizer --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 3e0675069af96ce2b947856aad4bf6a2d556158b ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_f986349c-add1-4cc4-8da0-7c80cbe320c6/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_f986349c-add1-4cc4-8da0-7c80cbe320c6/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_f986349c-add1-4cc4-8da0-7c80cbe320c6/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_f986349c-add1-4cc4-8da0-7c80cbe320c6/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/dll-rb-sentinel-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_f986349c-add1-4cc4-8da0-7c80cbe320c6/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_f986349c-add1-4cc4-8da0-7c80cbe320c6/bin/uautomizer --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 3e0675069af96ce2b947856aad4bf6a2d556158b ..................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: Sort C_DOUBLE not declared --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-16 00:12:08,196 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:12:08,197 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:12:08,207 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:12:08,208 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:12:08,209 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:12:08,210 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:12:08,212 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:12:08,214 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:12:08,214 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:12:08,215 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:12:08,217 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:12:08,217 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:12:08,218 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:12:08,219 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:12:08,220 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:12:08,220 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:12:08,221 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:12:08,223 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:12:08,224 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:12:08,226 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:12:08,227 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:12:08,228 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:12:08,228 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:12:08,232 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:12:08,233 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:12:08,233 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:12:08,234 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:12:08,234 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:12:08,235 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:12:08,235 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:12:08,235 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:12:08,236 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:12:08,237 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:12:08,237 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:12:08,238 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:12:08,238 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:12:08,238 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:12:08,239 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:12:08,239 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:12:08,240 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:12:08,240 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_f986349c-add1-4cc4-8da0-7c80cbe320c6/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-11-16 00:12:08,261 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:12:08,261 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:12:08,263 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:12:08,263 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:12:08,263 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:12:08,264 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:12:08,264 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-16 00:12:08,264 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-16 00:12:08,264 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:12:08,264 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-16 00:12:08,265 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:12:08,266 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-16 00:12:08,266 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-16 00:12:08,266 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-16 00:12:08,266 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-16 00:12:08,266 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-16 00:12:08,267 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:12:08,267 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:12:08,267 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:12:08,267 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-16 00:12:08,267 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-16 00:12:08,268 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:12:08,268 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:12:08,268 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-16 00:12:08,269 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-16 00:12:08,269 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-16 00:12:08,269 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_f986349c-add1-4cc4-8da0-7c80cbe320c6/bin/uautomizer 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 -> 3e0675069af96ce2b947856aad4bf6a2d556158b [2019-11-16 00:12:08,331 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:12:08,340 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:12:08,343 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:12:08,344 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:12:08,345 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:12:08,345 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_f986349c-add1-4cc4-8da0-7c80cbe320c6/bin/uautomizer/../../sv-benchmarks/c/forester-heap/dll-rb-sentinel-2.i [2019-11-16 00:12:08,410 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f986349c-add1-4cc4-8da0-7c80cbe320c6/bin/uautomizer/data/972d0e20b/440a6d5cc1724ffda52dda7ba6d8d895/FLAGfc41b241a [2019-11-16 00:12:08,881 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:12:08,881 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_f986349c-add1-4cc4-8da0-7c80cbe320c6/sv-benchmarks/c/forester-heap/dll-rb-sentinel-2.i [2019-11-16 00:12:08,893 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f986349c-add1-4cc4-8da0-7c80cbe320c6/bin/uautomizer/data/972d0e20b/440a6d5cc1724ffda52dda7ba6d8d895/FLAGfc41b241a [2019-11-16 00:12:09,365 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_f986349c-add1-4cc4-8da0-7c80cbe320c6/bin/uautomizer/data/972d0e20b/440a6d5cc1724ffda52dda7ba6d8d895 [2019-11-16 00:12:09,368 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:12:09,369 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-16 00:12:09,370 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:12:09,370 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:12:09,373 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:12:09,374 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:12:09" (1/1) ... [2019-11-16 00:12:09,377 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54e2de07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:12:09, skipping insertion in model container [2019-11-16 00:12:09,377 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:12:09" (1/1) ... [2019-11-16 00:12:09,384 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:12:09,433 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:12:09,804 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:12:09,817 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:12:09,898 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:12:09,961 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:12:09,962 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:12:09 WrapperNode [2019-11-16 00:12:09,962 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:12:09,963 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:12:09,963 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:12:09,963 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:12:09,978 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:12:09" (1/1) ... [2019-11-16 00:12:09,978 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:12:09" (1/1) ... [2019-11-16 00:12:09,994 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:12:09" (1/1) ... [2019-11-16 00:12:09,995 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:12:09" (1/1) ... [2019-11-16 00:12:10,024 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:12:09" (1/1) ... [2019-11-16 00:12:10,041 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:12:09" (1/1) ... [2019-11-16 00:12:10,045 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:12:09" (1/1) ... [2019-11-16 00:12:10,052 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:12:10,053 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:12:10,053 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:12:10,053 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:12:10,054 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:12:09" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f986349c-add1-4cc4-8da0-7c80cbe320c6/bin/uautomizer/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-11-16 00:12:10,115 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-16 00:12:10,116 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:12:10,116 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-16 00:12:10,117 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-16 00:12:10,117 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-16 00:12:10,117 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-16 00:12:10,118 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-16 00:12:10,118 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-16 00:12:10,119 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-16 00:12:10,119 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-16 00:12:10,119 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-16 00:12:10,120 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-16 00:12:10,121 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-16 00:12:10,121 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-16 00:12:10,121 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-16 00:12:10,121 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-16 00:12:10,121 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-16 00:12:10,122 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-16 00:12:10,124 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-16 00:12:10,124 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-16 00:12:10,125 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-16 00:12:10,125 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-16 00:12:10,125 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-16 00:12:10,126 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-16 00:12:10,126 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-16 00:12:10,126 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-16 00:12:10,126 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-16 00:12:10,128 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-16 00:12:10,128 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-16 00:12:10,128 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-16 00:12:10,128 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-16 00:12:10,128 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-16 00:12:10,129 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-16 00:12:10,129 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-16 00:12:10,129 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-16 00:12:10,129 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-16 00:12:10,129 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-16 00:12:10,129 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-16 00:12:10,130 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-16 00:12:10,130 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-16 00:12:10,130 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-16 00:12:10,130 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-16 00:12:10,130 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-16 00:12:10,130 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-16 00:12:10,130 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-16 00:12:10,131 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-16 00:12:10,131 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-16 00:12:10,131 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-16 00:12:10,131 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-16 00:12:10,131 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-16 00:12:10,131 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-16 00:12:10,132 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-16 00:12:10,132 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-16 00:12:10,132 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-16 00:12:10,132 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-16 00:12:10,132 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-16 00:12:10,132 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-16 00:12:10,133 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-16 00:12:10,133 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-16 00:12:10,133 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-16 00:12:10,134 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-16 00:12:10,134 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-16 00:12:10,134 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-16 00:12:10,134 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-16 00:12:10,134 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-16 00:12:10,134 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-16 00:12:10,135 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-16 00:12:10,135 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-16 00:12:10,135 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-16 00:12:10,135 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-16 00:12:10,136 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-16 00:12:10,136 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-16 00:12:10,136 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-16 00:12:10,137 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-16 00:12:10,137 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-16 00:12:10,138 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-16 00:12:10,138 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-16 00:12:10,139 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-16 00:12:10,139 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-16 00:12:10,140 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-16 00:12:10,140 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-16 00:12:10,140 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-16 00:12:10,140 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-16 00:12:10,140 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-16 00:12:10,140 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-16 00:12:10,141 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-16 00:12:10,141 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-16 00:12:10,142 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-16 00:12:10,142 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-16 00:12:10,142 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-16 00:12:10,142 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-16 00:12:10,143 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-16 00:12:10,143 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-16 00:12:10,143 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-16 00:12:10,143 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-16 00:12:10,143 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-16 00:12:10,143 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-16 00:12:10,143 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-16 00:12:10,144 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-16 00:12:10,144 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-16 00:12:10,144 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-16 00:12:10,144 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-16 00:12:10,144 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-16 00:12:10,144 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-16 00:12:10,144 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-16 00:12:10,145 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-16 00:12:10,145 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-16 00:12:10,145 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-16 00:12:10,145 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-16 00:12:10,145 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-16 00:12:10,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-16 00:12:10,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-16 00:12:10,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-16 00:12:10,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-16 00:12:10,146 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-16 00:12:10,146 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-16 00:12:10,147 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:12:10,881 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:12:10,881 INFO L284 CfgBuilder]: Removed 17 assume(true) statements. [2019-11-16 00:12:10,882 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:12:10 BoogieIcfgContainer [2019-11-16 00:12:10,882 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:12:10,883 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-16 00:12:10,883 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-16 00:12:10,888 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-16 00:12:10,888 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:12:09" (1/3) ... [2019-11-16 00:12:10,889 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c87d73e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:12:10, skipping insertion in model container [2019-11-16 00:12:10,889 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:12:09" (2/3) ... [2019-11-16 00:12:10,891 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c87d73e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:12:10, skipping insertion in model container [2019-11-16 00:12:10,891 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:12:10" (3/3) ... [2019-11-16 00:12:10,894 INFO L109 eAbstractionObserver]: Analyzing ICFG dll-rb-sentinel-2.i [2019-11-16 00:12:10,903 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-16 00:12:10,912 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 73 error locations. [2019-11-16 00:12:10,923 INFO L249 AbstractCegarLoop]: Starting to check reachability of 73 error locations. [2019-11-16 00:12:10,941 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-16 00:12:10,942 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-16 00:12:10,942 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-16 00:12:10,942 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:12:10,942 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:12:10,943 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-16 00:12:10,943 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:12:10,943 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-16 00:12:10,962 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states. [2019-11-16 00:12:10,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-16 00:12:10,970 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:12:10,971 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:12:10,973 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr20REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr64REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr67ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr66ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr65REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr71ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr72ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION]=== [2019-11-16 00:12:10,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:12:10,979 INFO L82 PathProgramCache]: Analyzing trace with hash -1834014549, now seen corresponding path program 1 times [2019-11-16 00:12:10,987 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:12:10,987 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178541029] [2019-11-16 00:12:10,987 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:10,987 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:10,988 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:12:11,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:11,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:11,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:12:11,151 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178541029] [2019-11-16 00:12:11,151 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:12:11,152 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:12:11,152 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238380963] [2019-11-16 00:12:11,158 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:12:11,158 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:12:11,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:12:11,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:12:11,174 INFO L87 Difference]: Start difference. First operand 160 states. Second operand 4 states. [2019-11-16 00:12:11,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:12:11,652 INFO L93 Difference]: Finished difference Result 187 states and 194 transitions. [2019-11-16 00:12:11,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:12:11,654 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-11-16 00:12:11,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:12:11,669 INFO L225 Difference]: With dead ends: 187 [2019-11-16 00:12:11,669 INFO L226 Difference]: Without dead ends: 184 [2019-11-16 00:12:11,672 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:12:11,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-11-16 00:12:11,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 158. [2019-11-16 00:12:11,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-11-16 00:12:11,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 166 transitions. [2019-11-16 00:12:11,723 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 166 transitions. Word has length 7 [2019-11-16 00:12:11,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:12:11,724 INFO L462 AbstractCegarLoop]: Abstraction has 158 states and 166 transitions. [2019-11-16 00:12:11,724 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:12:11,724 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 166 transitions. [2019-11-16 00:12:11,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-16 00:12:11,724 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:12:11,724 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:12:11,725 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr20REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr64REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr67ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr66ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr65REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr71ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr72ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION]=== [2019-11-16 00:12:11,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:12:11,725 INFO L82 PathProgramCache]: Analyzing trace with hash -1834014548, now seen corresponding path program 1 times [2019-11-16 00:12:11,726 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:12:11,726 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033886279] [2019-11-16 00:12:11,726 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:11,726 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:11,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:12:11,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:11,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:11,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:12:11,827 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033886279] [2019-11-16 00:12:11,828 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:12:11,828 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:12:11,828 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650147862] [2019-11-16 00:12:11,830 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:12:11,830 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:12:11,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:12:11,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:12:11,831 INFO L87 Difference]: Start difference. First operand 158 states and 166 transitions. Second operand 4 states. [2019-11-16 00:12:12,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:12:12,263 INFO L93 Difference]: Finished difference Result 154 states and 161 transitions. [2019-11-16 00:12:12,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:12:12,263 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-11-16 00:12:12,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:12:12,265 INFO L225 Difference]: With dead ends: 154 [2019-11-16 00:12:12,266 INFO L226 Difference]: Without dead ends: 154 [2019-11-16 00:12:12,266 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:12:12,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-11-16 00:12:12,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2019-11-16 00:12:12,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-11-16 00:12:12,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 161 transitions. [2019-11-16 00:12:12,289 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 161 transitions. Word has length 7 [2019-11-16 00:12:12,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:12:12,290 INFO L462 AbstractCegarLoop]: Abstraction has 154 states and 161 transitions. [2019-11-16 00:12:12,290 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:12:12,290 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 161 transitions. [2019-11-16 00:12:12,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-16 00:12:12,291 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:12:12,291 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:12:12,292 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr20REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr64REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr67ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr66ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr65REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr71ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr72ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION]=== [2019-11-16 00:12:12,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:12:12,293 INFO L82 PathProgramCache]: Analyzing trace with hash -533094097, now seen corresponding path program 1 times [2019-11-16 00:12:12,293 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:12:12,293 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389918069] [2019-11-16 00:12:12,293 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:12,294 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:12,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:12:12,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:12,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:12,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:12:12,410 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389918069] [2019-11-16 00:12:12,410 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:12:12,410 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:12:12,411 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148103398] [2019-11-16 00:12:12,411 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:12:12,411 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:12:12,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:12:12,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:12:12,412 INFO L87 Difference]: Start difference. First operand 154 states and 161 transitions. Second operand 4 states. [2019-11-16 00:12:12,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:12:12,808 INFO L93 Difference]: Finished difference Result 150 states and 156 transitions. [2019-11-16 00:12:12,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:12:12,809 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-16 00:12:12,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:12:12,811 INFO L225 Difference]: With dead ends: 150 [2019-11-16 00:12:12,811 INFO L226 Difference]: Without dead ends: 150 [2019-11-16 00:12:12,811 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:12:12,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-11-16 00:12:12,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 148. [2019-11-16 00:12:12,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-11-16 00:12:12,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 156 transitions. [2019-11-16 00:12:12,826 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 156 transitions. Word has length 11 [2019-11-16 00:12:12,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:12:12,826 INFO L462 AbstractCegarLoop]: Abstraction has 148 states and 156 transitions. [2019-11-16 00:12:12,826 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:12:12,827 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 156 transitions. [2019-11-16 00:12:12,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-16 00:12:12,827 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:12:12,827 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:12:12,828 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr20REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr64REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr67ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr66ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr65REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr71ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr72ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION]=== [2019-11-16 00:12:12,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:12:12,829 INFO L82 PathProgramCache]: Analyzing trace with hash -533094096, now seen corresponding path program 1 times [2019-11-16 00:12:12,829 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:12:12,829 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065219730] [2019-11-16 00:12:12,829 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:12,829 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:12,830 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:12:12,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:12,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:12,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:12:12,922 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065219730] [2019-11-16 00:12:12,922 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:12:12,922 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:12:12,922 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16422204] [2019-11-16 00:12:12,923 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:12:12,923 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:12:12,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:12:12,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:12:12,924 INFO L87 Difference]: Start difference. First operand 148 states and 156 transitions. Second operand 4 states. [2019-11-16 00:12:13,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:12:13,270 INFO L93 Difference]: Finished difference Result 165 states and 171 transitions. [2019-11-16 00:12:13,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:12:13,270 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-16 00:12:13,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:12:13,272 INFO L225 Difference]: With dead ends: 165 [2019-11-16 00:12:13,272 INFO L226 Difference]: Without dead ends: 165 [2019-11-16 00:12:13,272 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:12:13,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-11-16 00:12:13,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 152. [2019-11-16 00:12:13,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-11-16 00:12:13,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 160 transitions. [2019-11-16 00:12:13,281 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 160 transitions. Word has length 11 [2019-11-16 00:12:13,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:12:13,282 INFO L462 AbstractCegarLoop]: Abstraction has 152 states and 160 transitions. [2019-11-16 00:12:13,282 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:12:13,282 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 160 transitions. [2019-11-16 00:12:13,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-16 00:12:13,282 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:12:13,288 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:12:13,288 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr20REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr64REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr67ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr66ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr65REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr71ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr72ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION]=== [2019-11-16 00:12:13,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:12:13,288 INFO L82 PathProgramCache]: Analyzing trace with hash 2055157944, now seen corresponding path program 1 times [2019-11-16 00:12:13,288 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:12:13,289 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345614520] [2019-11-16 00:12:13,289 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:13,289 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:13,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:12:13,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:13,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:13,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:12:13,425 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345614520] [2019-11-16 00:12:13,425 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:12:13,426 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:12:13,426 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862058019] [2019-11-16 00:12:13,426 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:12:13,427 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:12:13,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:12:13,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:12:13,427 INFO L87 Difference]: Start difference. First operand 152 states and 160 transitions. Second operand 5 states. [2019-11-16 00:12:13,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:12:13,720 INFO L93 Difference]: Finished difference Result 152 states and 162 transitions. [2019-11-16 00:12:13,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:12:13,720 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-11-16 00:12:13,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:12:13,721 INFO L225 Difference]: With dead ends: 152 [2019-11-16 00:12:13,721 INFO L226 Difference]: Without dead ends: 152 [2019-11-16 00:12:13,722 INFO L600 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-11-16 00:12:13,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-11-16 00:12:13,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 139. [2019-11-16 00:12:13,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-11-16 00:12:13,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 149 transitions. [2019-11-16 00:12:13,730 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 149 transitions. Word has length 17 [2019-11-16 00:12:13,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:12:13,730 INFO L462 AbstractCegarLoop]: Abstraction has 139 states and 149 transitions. [2019-11-16 00:12:13,730 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:12:13,730 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 149 transitions. [2019-11-16 00:12:13,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-16 00:12:13,731 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:12:13,731 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:12:13,731 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr20REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr64REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr67ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr66ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr65REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr71ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr72ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION]=== [2019-11-16 00:12:13,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:12:13,732 INFO L82 PathProgramCache]: Analyzing trace with hash 2055157945, now seen corresponding path program 1 times [2019-11-16 00:12:13,732 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:12:13,732 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536488888] [2019-11-16 00:12:13,732 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:13,732 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:13,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:12:13,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:13,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:13,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:12:13,828 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536488888] [2019-11-16 00:12:13,828 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:12:13,829 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:12:13,829 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740148635] [2019-11-16 00:12:13,829 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:12:13,829 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:12:13,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:12:13,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:12:13,830 INFO L87 Difference]: Start difference. First operand 139 states and 149 transitions. Second operand 7 states. [2019-11-16 00:12:14,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:12:14,304 INFO L93 Difference]: Finished difference Result 180 states and 190 transitions. [2019-11-16 00:12:14,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:12:14,305 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2019-11-16 00:12:14,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:12:14,306 INFO L225 Difference]: With dead ends: 180 [2019-11-16 00:12:14,306 INFO L226 Difference]: Without dead ends: 180 [2019-11-16 00:12:14,306 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:12:14,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-11-16 00:12:14,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 148. [2019-11-16 00:12:14,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-11-16 00:12:14,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 161 transitions. [2019-11-16 00:12:14,310 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 161 transitions. Word has length 17 [2019-11-16 00:12:14,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:12:14,311 INFO L462 AbstractCegarLoop]: Abstraction has 148 states and 161 transitions. [2019-11-16 00:12:14,311 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:12:14,311 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 161 transitions. [2019-11-16 00:12:14,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-16 00:12:14,311 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:12:14,312 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:12:14,312 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr20REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr64REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr67ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr66ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr65REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr71ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr72ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION]=== [2019-11-16 00:12:14,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:12:14,312 INFO L82 PathProgramCache]: Analyzing trace with hash -678171781, now seen corresponding path program 1 times [2019-11-16 00:12:14,313 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:12:14,313 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884951895] [2019-11-16 00:12:14,313 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:14,313 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:14,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:12:14,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:14,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:14,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:12:14,379 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884951895] [2019-11-16 00:12:14,379 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:12:14,379 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:12:14,379 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229060413] [2019-11-16 00:12:14,379 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:12:14,380 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:12:14,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:12:14,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:12:14,380 INFO L87 Difference]: Start difference. First operand 148 states and 161 transitions. Second operand 6 states. [2019-11-16 00:12:14,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:12:14,776 INFO L93 Difference]: Finished difference Result 195 states and 213 transitions. [2019-11-16 00:12:14,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:12:14,776 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-11-16 00:12:14,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:12:14,777 INFO L225 Difference]: With dead ends: 195 [2019-11-16 00:12:14,778 INFO L226 Difference]: Without dead ends: 195 [2019-11-16 00:12:14,778 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:12:14,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-11-16 00:12:14,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 147. [2019-11-16 00:12:14,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-11-16 00:12:14,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 159 transitions. [2019-11-16 00:12:14,783 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 159 transitions. Word has length 19 [2019-11-16 00:12:14,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:12:14,784 INFO L462 AbstractCegarLoop]: Abstraction has 147 states and 159 transitions. [2019-11-16 00:12:14,784 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:12:14,784 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 159 transitions. [2019-11-16 00:12:14,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-16 00:12:14,785 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:12:14,785 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:12:14,785 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr20REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr64REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr67ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr66ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr65REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr71ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr72ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION]=== [2019-11-16 00:12:14,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:12:14,786 INFO L82 PathProgramCache]: Analyzing trace with hash -678171780, now seen corresponding path program 1 times [2019-11-16 00:12:14,786 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:12:14,786 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846001186] [2019-11-16 00:12:14,786 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:14,786 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:14,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:12:14,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:14,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:14,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:12:14,910 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846001186] [2019-11-16 00:12:14,910 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:12:14,910 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:12:14,910 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208934647] [2019-11-16 00:12:14,911 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:12:14,911 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:12:14,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:12:14,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:12:14,911 INFO L87 Difference]: Start difference. First operand 147 states and 159 transitions. Second operand 6 states. [2019-11-16 00:12:15,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:12:15,512 INFO L93 Difference]: Finished difference Result 224 states and 243 transitions. [2019-11-16 00:12:15,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:12:15,512 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-11-16 00:12:15,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:12:15,514 INFO L225 Difference]: With dead ends: 224 [2019-11-16 00:12:15,514 INFO L226 Difference]: Without dead ends: 224 [2019-11-16 00:12:15,515 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:12:15,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2019-11-16 00:12:15,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 146. [2019-11-16 00:12:15,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-16 00:12:15,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 157 transitions. [2019-11-16 00:12:15,520 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 157 transitions. Word has length 19 [2019-11-16 00:12:15,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:12:15,520 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 157 transitions. [2019-11-16 00:12:15,521 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:12:15,521 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 157 transitions. [2019-11-16 00:12:15,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-16 00:12:15,522 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:12:15,522 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:12:15,522 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr20REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr64REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr67ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr66ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr65REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr71ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr72ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION]=== [2019-11-16 00:12:15,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:12:15,523 INFO L82 PathProgramCache]: Analyzing trace with hash -864985795, now seen corresponding path program 1 times [2019-11-16 00:12:15,523 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:12:15,523 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154242415] [2019-11-16 00:12:15,523 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:15,523 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:15,523 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:12:15,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:15,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:15,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:12:15,677 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154242415] [2019-11-16 00:12:15,678 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:12:15,678 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-16 00:12:15,678 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738149828] [2019-11-16 00:12:15,678 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-16 00:12:15,678 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:12:15,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-16 00:12:15,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:12:15,679 INFO L87 Difference]: Start difference. First operand 146 states and 157 transitions. Second operand 10 states. [2019-11-16 00:12:16,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:12:16,414 INFO L93 Difference]: Finished difference Result 157 states and 169 transitions. [2019-11-16 00:12:16,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-16 00:12:16,414 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2019-11-16 00:12:16,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:12:16,416 INFO L225 Difference]: With dead ends: 157 [2019-11-16 00:12:16,416 INFO L226 Difference]: Without dead ends: 157 [2019-11-16 00:12:16,416 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2019-11-16 00:12:16,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-11-16 00:12:16,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 145. [2019-11-16 00:12:16,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-11-16 00:12:16,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 156 transitions. [2019-11-16 00:12:16,421 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 156 transitions. Word has length 23 [2019-11-16 00:12:16,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:12:16,421 INFO L462 AbstractCegarLoop]: Abstraction has 145 states and 156 transitions. [2019-11-16 00:12:16,423 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-16 00:12:16,423 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 156 transitions. [2019-11-16 00:12:16,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-16 00:12:16,424 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:12:16,424 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:12:16,425 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr20REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr64REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr67ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr66ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr65REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr71ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr72ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION]=== [2019-11-16 00:12:16,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:12:16,425 INFO L82 PathProgramCache]: Analyzing trace with hash -864985794, now seen corresponding path program 1 times [2019-11-16 00:12:16,426 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:12:16,426 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410163366] [2019-11-16 00:12:16,426 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:16,426 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:16,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:12:16,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:16,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:16,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:12:16,618 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410163366] [2019-11-16 00:12:16,618 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:12:16,618 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-16 00:12:16,619 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124728618] [2019-11-16 00:12:16,619 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-16 00:12:16,619 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:12:16,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-16 00:12:16,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-11-16 00:12:16,620 INFO L87 Difference]: Start difference. First operand 145 states and 156 transitions. Second operand 11 states. [2019-11-16 00:12:17,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:12:17,684 INFO L93 Difference]: Finished difference Result 168 states and 181 transitions. [2019-11-16 00:12:17,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-16 00:12:17,685 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 23 [2019-11-16 00:12:17,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:12:17,686 INFO L225 Difference]: With dead ends: 168 [2019-11-16 00:12:17,687 INFO L226 Difference]: Without dead ends: 168 [2019-11-16 00:12:17,687 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2019-11-16 00:12:17,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-11-16 00:12:17,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 147. [2019-11-16 00:12:17,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-11-16 00:12:17,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 158 transitions. [2019-11-16 00:12:17,691 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 158 transitions. Word has length 23 [2019-11-16 00:12:17,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:12:17,692 INFO L462 AbstractCegarLoop]: Abstraction has 147 states and 158 transitions. [2019-11-16 00:12:17,692 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-16 00:12:17,692 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 158 transitions. [2019-11-16 00:12:17,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-16 00:12:17,693 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:12:17,693 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:12:17,693 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr20REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr64REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr67ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr66ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr65REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr71ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr72ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION]=== [2019-11-16 00:12:17,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:12:17,693 INFO L82 PathProgramCache]: Analyzing trace with hash -1651615046, now seen corresponding path program 1 times [2019-11-16 00:12:17,694 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:12:17,694 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413774345] [2019-11-16 00:12:17,694 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:17,694 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:17,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:12:17,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:17,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:17,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:12:17,786 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413774345] [2019-11-16 00:12:17,787 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:12:17,787 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:12:17,787 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380281965] [2019-11-16 00:12:17,787 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:12:17,787 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:12:17,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:12:17,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:12:17,788 INFO L87 Difference]: Start difference. First operand 147 states and 158 transitions. Second operand 7 states. [2019-11-16 00:12:18,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:12:18,113 INFO L93 Difference]: Finished difference Result 176 states and 188 transitions. [2019-11-16 00:12:18,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:12:18,113 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2019-11-16 00:12:18,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:12:18,115 INFO L225 Difference]: With dead ends: 176 [2019-11-16 00:12:18,115 INFO L226 Difference]: Without dead ends: 176 [2019-11-16 00:12:18,115 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-11-16 00:12:18,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2019-11-16 00:12:18,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 147. [2019-11-16 00:12:18,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-11-16 00:12:18,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 157 transitions. [2019-11-16 00:12:18,119 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 157 transitions. Word has length 26 [2019-11-16 00:12:18,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:12:18,120 INFO L462 AbstractCegarLoop]: Abstraction has 147 states and 157 transitions. [2019-11-16 00:12:18,120 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:12:18,120 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 157 transitions. [2019-11-16 00:12:18,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-16 00:12:18,121 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:12:18,121 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:12:18,121 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr20REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr64REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr67ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr66ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr65REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr71ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr72ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION]=== [2019-11-16 00:12:18,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:12:18,122 INFO L82 PathProgramCache]: Analyzing trace with hash -89546133, now seen corresponding path program 1 times [2019-11-16 00:12:18,122 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:12:18,122 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502933006] [2019-11-16 00:12:18,122 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:18,122 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:18,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:12:18,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:18,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:18,209 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:12:18,209 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502933006] [2019-11-16 00:12:18,209 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [403923054] [2019-11-16 00:12:18,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f986349c-add1-4cc4-8da0-7c80cbe320c6/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:12:18,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:18,347 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-16 00:12:18,353 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:12:18,409 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-16 00:12:18,409 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:12:18,415 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:12:18,421 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-16 00:12:18,422 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:12:18,431 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:12:18,432 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:12:18,432 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:15 [2019-11-16 00:12:18,443 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-11-16 00:12:18,446 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:12:18,448 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:12:18,451 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:12:18,453 INFO L375 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 16 treesize of output 20 [2019-11-16 00:12:18,453 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:12:18,466 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:12:18,467 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:12:18,479 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:12:18,484 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-11-16 00:12:18,487 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:12:18,489 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:12:18,492 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:12:18,493 INFO L375 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 16 treesize of output 20 [2019-11-16 00:12:18,494 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-16 00:12:18,500 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:12:18,500 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:12:18,510 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:12:18,510 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:12:18,511 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:51, output treesize:33 [2019-11-16 00:12:18,541 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:12:18,543 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:12:18,544 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:12:18,546 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2019-11-16 00:12:18,547 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:12:18,564 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:12:18,570 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:12:18,573 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:12:18,575 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:12:18,576 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2019-11-16 00:12:18,577 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:12:18,590 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:12:18,590 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:12:18,590 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:71, output treesize:33 [2019-11-16 00:12:18,628 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:12:18,628 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 10 [2019-11-16 00:12:18,629 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:12:18,636 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:12:18,646 INFO L341 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2019-11-16 00:12:18,647 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 10 [2019-11-16 00:12:18,647 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:12:18,650 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:12:18,651 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:12:18,651 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:47, output treesize:7 [2019-11-16 00:12:18,654 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:12:18,655 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:12:18,655 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2019-11-16 00:12:18,655 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082817204] [2019-11-16 00:12:18,655 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-16 00:12:18,655 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:12:18,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-16 00:12:18,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:12:18,656 INFO L87 Difference]: Start difference. First operand 147 states and 157 transitions. Second operand 9 states. [2019-11-16 00:12:19,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:12:19,282 INFO L93 Difference]: Finished difference Result 210 states and 223 transitions. [2019-11-16 00:12:19,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-16 00:12:19,282 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2019-11-16 00:12:19,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:12:19,284 INFO L225 Difference]: With dead ends: 210 [2019-11-16 00:12:19,284 INFO L226 Difference]: Without dead ends: 210 [2019-11-16 00:12:19,284 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 28 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-11-16 00:12:19,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-11-16 00:12:19,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 161. [2019-11-16 00:12:19,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-11-16 00:12:19,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 173 transitions. [2019-11-16 00:12:19,289 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 173 transitions. Word has length 29 [2019-11-16 00:12:19,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:12:19,290 INFO L462 AbstractCegarLoop]: Abstraction has 161 states and 173 transitions. [2019-11-16 00:12:19,290 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-16 00:12:19,290 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 173 transitions. [2019-11-16 00:12:19,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-16 00:12:19,291 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:12:19,291 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:12:19,494 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:12:19,494 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr20REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr64REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr67ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr66ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr65REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr71ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr72ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION]=== [2019-11-16 00:12:19,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:12:19,495 INFO L82 PathProgramCache]: Analyzing trace with hash 1674558588, now seen corresponding path program 1 times [2019-11-16 00:12:19,495 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:12:19,495 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497191165] [2019-11-16 00:12:19,495 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:19,495 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:19,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:12:19,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:19,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:19,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:12:19,569 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497191165] [2019-11-16 00:12:19,569 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:12:19,569 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:12:19,569 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764294606] [2019-11-16 00:12:19,569 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:12:19,570 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:12:19,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:12:19,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:12:19,570 INFO L87 Difference]: Start difference. First operand 161 states and 173 transitions. Second operand 6 states. [2019-11-16 00:12:19,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:12:19,975 INFO L93 Difference]: Finished difference Result 230 states and 249 transitions. [2019-11-16 00:12:19,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:12:19,976 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2019-11-16 00:12:19,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:12:19,977 INFO L225 Difference]: With dead ends: 230 [2019-11-16 00:12:19,977 INFO L226 Difference]: Without dead ends: 230 [2019-11-16 00:12:19,977 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:12:19,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-11-16 00:12:19,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 160. [2019-11-16 00:12:19,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-11-16 00:12:19,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 172 transitions. [2019-11-16 00:12:19,982 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 172 transitions. Word has length 30 [2019-11-16 00:12:19,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:12:19,982 INFO L462 AbstractCegarLoop]: Abstraction has 160 states and 172 transitions. [2019-11-16 00:12:19,983 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:12:19,983 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 172 transitions. [2019-11-16 00:12:19,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-16 00:12:19,984 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:12:19,984 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:12:19,984 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr20REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr64REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr67ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr66ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr65REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr71ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr72ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION]=== [2019-11-16 00:12:19,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:12:19,984 INFO L82 PathProgramCache]: Analyzing trace with hash 1674558589, now seen corresponding path program 1 times [2019-11-16 00:12:19,985 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:12:19,985 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118824366] [2019-11-16 00:12:19,985 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:19,985 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:19,985 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:12:19,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:20,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:20,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:12:20,048 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118824366] [2019-11-16 00:12:20,048 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:12:20,049 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:12:20,049 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347762764] [2019-11-16 00:12:20,049 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:12:20,049 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:12:20,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:12:20,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:12:20,050 INFO L87 Difference]: Start difference. First operand 160 states and 172 transitions. Second operand 6 states. [2019-11-16 00:12:20,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:12:20,476 INFO L93 Difference]: Finished difference Result 259 states and 280 transitions. [2019-11-16 00:12:20,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:12:20,478 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2019-11-16 00:12:20,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:12:20,479 INFO L225 Difference]: With dead ends: 259 [2019-11-16 00:12:20,479 INFO L226 Difference]: Without dead ends: 259 [2019-11-16 00:12:20,480 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:12:20,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2019-11-16 00:12:20,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 159. [2019-11-16 00:12:20,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2019-11-16 00:12:20,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 171 transitions. [2019-11-16 00:12:20,485 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 171 transitions. Word has length 30 [2019-11-16 00:12:20,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:12:20,485 INFO L462 AbstractCegarLoop]: Abstraction has 159 states and 171 transitions. [2019-11-16 00:12:20,485 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:12:20,486 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 171 transitions. [2019-11-16 00:12:20,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-16 00:12:20,487 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:12:20,487 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:12:20,487 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr20REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr64REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr67ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr66ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr65REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr71ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr72ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION]=== [2019-11-16 00:12:20,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:12:20,488 INFO L82 PathProgramCache]: Analyzing trace with hash 334803469, now seen corresponding path program 1 times [2019-11-16 00:12:20,488 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:12:20,488 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134848740] [2019-11-16 00:12:20,488 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:20,489 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:20,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:12:20,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:20,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:20,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:12:20,594 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134848740] [2019-11-16 00:12:20,594 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:12:20,594 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:12:20,594 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310159564] [2019-11-16 00:12:20,595 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:12:20,595 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:12:20,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:12:20,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:12:20,595 INFO L87 Difference]: Start difference. First operand 159 states and 171 transitions. Second operand 6 states. [2019-11-16 00:12:20,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:12:20,917 INFO L93 Difference]: Finished difference Result 162 states and 172 transitions. [2019-11-16 00:12:20,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:12:20,917 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2019-11-16 00:12:20,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:12:20,918 INFO L225 Difference]: With dead ends: 162 [2019-11-16 00:12:20,918 INFO L226 Difference]: Without dead ends: 162 [2019-11-16 00:12:20,919 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:12:20,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-11-16 00:12:20,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 158. [2019-11-16 00:12:20,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-11-16 00:12:20,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 168 transitions. [2019-11-16 00:12:20,923 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 168 transitions. Word has length 30 [2019-11-16 00:12:20,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:12:20,924 INFO L462 AbstractCegarLoop]: Abstraction has 158 states and 168 transitions. [2019-11-16 00:12:20,924 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:12:20,924 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 168 transitions. [2019-11-16 00:12:20,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-16 00:12:20,925 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:12:20,926 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:12:20,926 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr20REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr64REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr67ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr66ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr65REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr71ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr72ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION]=== [2019-11-16 00:12:20,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:12:20,927 INFO L82 PathProgramCache]: Analyzing trace with hash -154482584, now seen corresponding path program 1 times [2019-11-16 00:12:20,927 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:12:20,927 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195985280] [2019-11-16 00:12:20,927 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:20,927 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:20,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:12:20,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:21,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:21,007 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:12:21,007 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195985280] [2019-11-16 00:12:21,007 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:12:21,007 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:12:21,007 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453575049] [2019-11-16 00:12:21,008 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:12:21,008 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:12:21,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:12:21,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:12:21,008 INFO L87 Difference]: Start difference. First operand 158 states and 168 transitions. Second operand 7 states. [2019-11-16 00:12:21,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:12:21,389 INFO L93 Difference]: Finished difference Result 172 states and 180 transitions. [2019-11-16 00:12:21,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:12:21,389 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2019-11-16 00:12:21,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:12:21,390 INFO L225 Difference]: With dead ends: 172 [2019-11-16 00:12:21,390 INFO L226 Difference]: Without dead ends: 172 [2019-11-16 00:12:21,391 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2019-11-16 00:12:21,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2019-11-16 00:12:21,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 155. [2019-11-16 00:12:21,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-11-16 00:12:21,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 163 transitions. [2019-11-16 00:12:21,395 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 163 transitions. Word has length 31 [2019-11-16 00:12:21,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:12:21,395 INFO L462 AbstractCegarLoop]: Abstraction has 155 states and 163 transitions. [2019-11-16 00:12:21,395 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:12:21,395 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 163 transitions. [2019-11-16 00:12:21,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-16 00:12:21,396 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:12:21,396 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:12:21,397 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr20REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr64REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr67ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr66ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr65REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr71ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr72ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION]=== [2019-11-16 00:12:21,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:12:21,397 INFO L82 PathProgramCache]: Analyzing trace with hash 1148771646, now seen corresponding path program 1 times [2019-11-16 00:12:21,402 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:12:21,403 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022173462] [2019-11-16 00:12:21,403 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:21,403 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:21,403 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:12:21,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:21,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:21,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:12:21,585 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022173462] [2019-11-16 00:12:21,585 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:12:21,585 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-16 00:12:21,585 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045229737] [2019-11-16 00:12:21,586 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-16 00:12:21,587 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:12:21,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-16 00:12:21,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-11-16 00:12:21,588 INFO L87 Difference]: Start difference. First operand 155 states and 163 transitions. Second operand 13 states. [2019-11-16 00:12:22,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:12:22,236 INFO L93 Difference]: Finished difference Result 154 states and 162 transitions. [2019-11-16 00:12:22,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-16 00:12:22,237 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2019-11-16 00:12:22,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:12:22,238 INFO L225 Difference]: With dead ends: 154 [2019-11-16 00:12:22,238 INFO L226 Difference]: Without dead ends: 154 [2019-11-16 00:12:22,238 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=386, Unknown=0, NotChecked=0, Total=506 [2019-11-16 00:12:22,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-11-16 00:12:22,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2019-11-16 00:12:22,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-11-16 00:12:22,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 162 transitions. [2019-11-16 00:12:22,243 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 162 transitions. Word has length 34 [2019-11-16 00:12:22,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:12:22,243 INFO L462 AbstractCegarLoop]: Abstraction has 154 states and 162 transitions. [2019-11-16 00:12:22,243 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-16 00:12:22,243 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 162 transitions. [2019-11-16 00:12:22,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-16 00:12:22,244 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:12:22,244 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:12:22,245 INFO L410 AbstractCegarLoop]: === Iteration 18 === [mainErr20REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr64REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr67ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr66ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr65REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr71ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr72ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION]=== [2019-11-16 00:12:22,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:12:22,245 INFO L82 PathProgramCache]: Analyzing trace with hash 1148771647, now seen corresponding path program 1 times [2019-11-16 00:12:22,247 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:12:22,247 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926808585] [2019-11-16 00:12:22,247 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:22,247 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:22,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:12:22,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:22,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:22,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:12:22,526 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926808585] [2019-11-16 00:12:22,526 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:12:22,526 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-11-16 00:12:22,527 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526553734] [2019-11-16 00:12:22,527 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-16 00:12:22,527 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:12:22,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-16 00:12:22,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-11-16 00:12:22,528 INFO L87 Difference]: Start difference. First operand 154 states and 162 transitions. Second operand 14 states. [2019-11-16 00:12:23,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:12:23,575 INFO L93 Difference]: Finished difference Result 149 states and 157 transitions. [2019-11-16 00:12:23,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-16 00:12:23,576 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 34 [2019-11-16 00:12:23,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:12:23,577 INFO L225 Difference]: With dead ends: 149 [2019-11-16 00:12:23,577 INFO L226 Difference]: Without dead ends: 149 [2019-11-16 00:12:23,577 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=147, Invalid=555, Unknown=0, NotChecked=0, Total=702 [2019-11-16 00:12:23,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-11-16 00:12:23,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 132. [2019-11-16 00:12:23,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-11-16 00:12:23,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 139 transitions. [2019-11-16 00:12:23,581 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 139 transitions. Word has length 34 [2019-11-16 00:12:23,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:12:23,581 INFO L462 AbstractCegarLoop]: Abstraction has 132 states and 139 transitions. [2019-11-16 00:12:23,581 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-16 00:12:23,581 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 139 transitions. [2019-11-16 00:12:23,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-16 00:12:23,582 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:12:23,582 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:12:23,582 INFO L410 AbstractCegarLoop]: === Iteration 19 === [mainErr20REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr64REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr67ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr66ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr65REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr71ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr72ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION]=== [2019-11-16 00:12:23,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:12:23,583 INFO L82 PathProgramCache]: Analyzing trace with hash -1466182222, now seen corresponding path program 1 times [2019-11-16 00:12:23,583 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:12:23,583 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58010515] [2019-11-16 00:12:23,583 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:23,583 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:23,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:12:23,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:23,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:23,658 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:12:23,659 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58010515] [2019-11-16 00:12:23,659 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [378753809] [2019-11-16 00:12:23,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f986349c-add1-4cc4-8da0-7c80cbe320c6/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:12:23,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:23,781 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-16 00:12:23,795 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:12:23,816 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:12:23,816 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:12:23,816 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [9] total 10 [2019-11-16 00:12:23,816 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925422004] [2019-11-16 00:12:23,817 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:12:23,817 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:12:23,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:12:23,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:12:23,818 INFO L87 Difference]: Start difference. First operand 132 states and 139 transitions. Second operand 3 states. [2019-11-16 00:12:23,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:12:23,866 INFO L93 Difference]: Finished difference Result 134 states and 141 transitions. [2019-11-16 00:12:23,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:12:23,866 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-11-16 00:12:23,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:12:23,867 INFO L225 Difference]: With dead ends: 134 [2019-11-16 00:12:23,867 INFO L226 Difference]: Without dead ends: 134 [2019-11-16 00:12:23,868 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:12:23,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-11-16 00:12:23,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2019-11-16 00:12:23,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-11-16 00:12:23,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 141 transitions. [2019-11-16 00:12:23,871 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 141 transitions. Word has length 35 [2019-11-16 00:12:23,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:12:23,871 INFO L462 AbstractCegarLoop]: Abstraction has 134 states and 141 transitions. [2019-11-16 00:12:23,871 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:12:23,871 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 141 transitions. [2019-11-16 00:12:23,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-16 00:12:23,872 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:12:23,872 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:12:24,076 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:12:24,081 INFO L410 AbstractCegarLoop]: === Iteration 20 === [mainErr20REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr64REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr67ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr66ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr65REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr71ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr72ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION]=== [2019-11-16 00:12:24,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:12:24,082 INFO L82 PathProgramCache]: Analyzing trace with hash -251833035, now seen corresponding path program 1 times [2019-11-16 00:12:24,083 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:12:24,083 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219160681] [2019-11-16 00:12:24,083 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:24,083 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:24,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:12:24,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:24,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:24,183 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:12:24,183 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219160681] [2019-11-16 00:12:24,183 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [464101234] [2019-11-16 00:12:24,183 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f986349c-add1-4cc4-8da0-7c80cbe320c6/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:12:24,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:24,320 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-16 00:12:24,326 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:12:24,338 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-16 00:12:24,338 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:12:24,342 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:12:24,342 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:12:24,342 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-11-16 00:12:24,349 INFO L375 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 7 [2019-11-16 00:12:24,349 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:12:24,351 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:12:24,351 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:12:24,351 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-11-16 00:12:24,365 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:12:24,365 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:12:24,366 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 10 [2019-11-16 00:12:24,366 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692144225] [2019-11-16 00:12:24,366 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:12:24,366 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:12:24,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:12:24,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:12:24,367 INFO L87 Difference]: Start difference. First operand 134 states and 141 transitions. Second operand 4 states. [2019-11-16 00:12:24,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:12:24,453 INFO L93 Difference]: Finished difference Result 143 states and 150 transitions. [2019-11-16 00:12:24,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:12:24,454 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2019-11-16 00:12:24,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:12:24,455 INFO L225 Difference]: With dead ends: 143 [2019-11-16 00:12:24,455 INFO L226 Difference]: Without dead ends: 143 [2019-11-16 00:12:24,455 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-11-16 00:12:24,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-11-16 00:12:24,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 137. [2019-11-16 00:12:24,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-11-16 00:12:24,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 144 transitions. [2019-11-16 00:12:24,458 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 144 transitions. Word has length 37 [2019-11-16 00:12:24,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:12:24,459 INFO L462 AbstractCegarLoop]: Abstraction has 137 states and 144 transitions. [2019-11-16 00:12:24,459 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:12:24,459 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 144 transitions. [2019-11-16 00:12:24,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-16 00:12:24,459 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:12:24,459 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:12:24,662 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:12:24,663 INFO L410 AbstractCegarLoop]: === Iteration 21 === [mainErr20REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr64REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr67ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr66ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr65REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr71ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr72ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION]=== [2019-11-16 00:12:24,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:12:24,663 INFO L82 PathProgramCache]: Analyzing trace with hash -828688271, now seen corresponding path program 1 times [2019-11-16 00:12:24,663 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:12:24,663 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923466922] [2019-11-16 00:12:24,663 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:24,664 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:24,664 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:12:24,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:24,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:24,843 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:12:24,843 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923466922] [2019-11-16 00:12:24,844 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1426232579] [2019-11-16 00:12:24,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f986349c-add1-4cc4-8da0-7c80cbe320c6/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:12:24,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:24,968 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 29 conjunts are in the unsatisfiable core [2019-11-16 00:12:24,972 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:12:24,978 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-16 00:12:24,978 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:12:24,983 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:12:24,984 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:12:24,984 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-11-16 00:12:25,006 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:12:25,007 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2019-11-16 00:12:25,008 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:12:25,018 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:12:25,018 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:12:25,019 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2019-11-16 00:12:25,052 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_46|], 6=[|v_#memory_$Pointer$.base_48|]} [2019-11-16 00:12:25,056 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 19 treesize of output 1 [2019-11-16 00:12:25,056 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:12:25,071 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:12:25,075 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:12:25,076 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:12:25,077 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:12:25,078 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:12:25,079 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 23 [2019-11-16 00:12:25,079 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:12:25,090 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:12:25,090 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:12:25,091 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:58, output treesize:20 [2019-11-16 00:12:25,205 INFO L392 ElimStorePlain]: Different costs {0=[|#memory_$Pointer$.offset|], 2=[|#memory_$Pointer$.base|]} [2019-11-16 00:12:25,208 INFO L375 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 7 [2019-11-16 00:12:25,208 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:12:25,216 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:12:25,221 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:12:25,222 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:12:25,223 INFO L375 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 24 treesize of output 10 [2019-11-16 00:12:25,223 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:12:25,233 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:12:25,234 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:12:25,234 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:41, output treesize:10 [2019-11-16 00:12:25,296 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:12:25,299 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:12:25,299 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12] total 16 [2019-11-16 00:12:25,299 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888670867] [2019-11-16 00:12:25,300 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-16 00:12:25,300 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:12:25,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-16 00:12:25,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2019-11-16 00:12:25,301 INFO L87 Difference]: Start difference. First operand 137 states and 144 transitions. Second operand 16 states. [2019-11-16 00:12:26,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:12:26,083 INFO L93 Difference]: Finished difference Result 151 states and 157 transitions. [2019-11-16 00:12:26,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-16 00:12:26,083 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 38 [2019-11-16 00:12:26,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:12:26,084 INFO L225 Difference]: With dead ends: 151 [2019-11-16 00:12:26,084 INFO L226 Difference]: Without dead ends: 151 [2019-11-16 00:12:26,085 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=110, Invalid=442, Unknown=0, NotChecked=0, Total=552 [2019-11-16 00:12:26,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-11-16 00:12:26,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 143. [2019-11-16 00:12:26,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-11-16 00:12:26,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 150 transitions. [2019-11-16 00:12:26,088 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 150 transitions. Word has length 38 [2019-11-16 00:12:26,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:12:26,089 INFO L462 AbstractCegarLoop]: Abstraction has 143 states and 150 transitions. [2019-11-16 00:12:26,089 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-16 00:12:26,089 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 150 transitions. [2019-11-16 00:12:26,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-16 00:12:26,090 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:12:26,090 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:12:26,293 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:12:26,297 INFO L410 AbstractCegarLoop]: === Iteration 22 === [mainErr20REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr64REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr67ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr66ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr65REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr71ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr72ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION]=== [2019-11-16 00:12:26,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:12:26,298 INFO L82 PathProgramCache]: Analyzing trace with hash 80467042, now seen corresponding path program 1 times [2019-11-16 00:12:26,298 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:12:26,298 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219088444] [2019-11-16 00:12:26,298 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:26,299 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:26,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:12:26,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:26,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:26,347 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-16 00:12:26,347 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219088444] [2019-11-16 00:12:26,347 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:12:26,348 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:12:26,348 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645083276] [2019-11-16 00:12:26,349 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:12:26,350 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:12:26,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:12:26,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:12:26,350 INFO L87 Difference]: Start difference. First operand 143 states and 150 transitions. Second operand 4 states. [2019-11-16 00:12:26,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:12:26,537 INFO L93 Difference]: Finished difference Result 142 states and 149 transitions. [2019-11-16 00:12:26,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:12:26,540 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2019-11-16 00:12:26,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:12:26,541 INFO L225 Difference]: With dead ends: 142 [2019-11-16 00:12:26,541 INFO L226 Difference]: Without dead ends: 142 [2019-11-16 00:12:26,541 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:12:26,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-11-16 00:12:26,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2019-11-16 00:12:26,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-11-16 00:12:26,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 149 transitions. [2019-11-16 00:12:26,545 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 149 transitions. Word has length 39 [2019-11-16 00:12:26,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:12:26,546 INFO L462 AbstractCegarLoop]: Abstraction has 142 states and 149 transitions. [2019-11-16 00:12:26,546 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:12:26,546 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 149 transitions. [2019-11-16 00:12:26,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-16 00:12:26,546 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:12:26,546 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:12:26,547 INFO L410 AbstractCegarLoop]: === Iteration 23 === [mainErr20REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr64REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr67ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr66ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr65REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr71ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr72ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION]=== [2019-11-16 00:12:26,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:12:26,547 INFO L82 PathProgramCache]: Analyzing trace with hash -1800488674, now seen corresponding path program 1 times [2019-11-16 00:12:26,547 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:12:26,547 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490456195] [2019-11-16 00:12:26,547 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:26,547 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:26,548 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:12:26,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:26,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:26,652 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:12:26,652 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490456195] [2019-11-16 00:12:26,652 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1163270516] [2019-11-16 00:12:26,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f986349c-add1-4cc4-8da0-7c80cbe320c6/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:12:26,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:26,760 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-16 00:12:26,762 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:12:26,794 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:12:26,794 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 28 [2019-11-16 00:12:26,795 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:12:26,807 INFO L567 ElimStorePlain]: treesize reduction 14, result has 50.0 percent of original size [2019-11-16 00:12:26,808 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:12:26,808 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-11-16 00:12:26,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:26,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:26,930 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 24 treesize of output 24 [2019-11-16 00:12:26,930 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:12:26,956 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:12:26,956 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 23 treesize of output 45 [2019-11-16 00:12:26,957 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:12:26,999 INFO L567 ElimStorePlain]: treesize reduction 23, result has 54.0 percent of original size [2019-11-16 00:12:27,000 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-11-16 00:12:27,000 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:48, output treesize:24 [2019-11-16 00:12:27,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:27,085 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:12:27,087 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:12:27,087 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2019-11-16 00:12:27,087 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757056148] [2019-11-16 00:12:27,088 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-16 00:12:27,088 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:12:27,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-16 00:12:27,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2019-11-16 00:12:27,088 INFO L87 Difference]: Start difference. First operand 142 states and 149 transitions. Second operand 15 states. [2019-11-16 00:12:28,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:12:28,025 INFO L93 Difference]: Finished difference Result 188 states and 197 transitions. [2019-11-16 00:12:28,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-16 00:12:28,027 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 40 [2019-11-16 00:12:28,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:12:28,029 INFO L225 Difference]: With dead ends: 188 [2019-11-16 00:12:28,029 INFO L226 Difference]: Without dead ends: 188 [2019-11-16 00:12:28,030 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=141, Invalid=411, Unknown=0, NotChecked=0, Total=552 [2019-11-16 00:12:28,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-11-16 00:12:28,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 147. [2019-11-16 00:12:28,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-11-16 00:12:28,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 155 transitions. [2019-11-16 00:12:28,036 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 155 transitions. Word has length 40 [2019-11-16 00:12:28,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:12:28,036 INFO L462 AbstractCegarLoop]: Abstraction has 147 states and 155 transitions. [2019-11-16 00:12:28,036 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-16 00:12:28,036 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 155 transitions. [2019-11-16 00:12:28,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-16 00:12:28,037 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:12:28,037 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:12:28,240 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:12:28,241 INFO L410 AbstractCegarLoop]: === Iteration 24 === [mainErr20REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr64REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr67ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr66ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr65REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr71ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr72ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION]=== [2019-11-16 00:12:28,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:12:28,241 INFO L82 PathProgramCache]: Analyzing trace with hash 19426277, now seen corresponding path program 1 times [2019-11-16 00:12:28,241 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:12:28,241 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637961947] [2019-11-16 00:12:28,242 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:28,242 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:28,242 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:12:28,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:28,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:28,444 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:12:28,445 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637961947] [2019-11-16 00:12:28,445 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1006053809] [2019-11-16 00:12:28,445 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f986349c-add1-4cc4-8da0-7c80cbe320c6/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:12:28,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:28,601 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-16 00:12:28,603 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:12:28,862 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:12:28,862 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:12:28,862 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 15 [2019-11-16 00:12:28,862 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710968043] [2019-11-16 00:12:28,862 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-16 00:12:28,863 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:12:28,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-16 00:12:28,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2019-11-16 00:12:28,863 INFO L87 Difference]: Start difference. First operand 147 states and 155 transitions. Second operand 16 states. [2019-11-16 00:12:29,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:12:29,462 INFO L93 Difference]: Finished difference Result 151 states and 158 transitions. [2019-11-16 00:12:29,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-16 00:12:29,462 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 41 [2019-11-16 00:12:29,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:12:29,463 INFO L225 Difference]: With dead ends: 151 [2019-11-16 00:12:29,463 INFO L226 Difference]: Without dead ends: 126 [2019-11-16 00:12:29,463 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=91, Invalid=371, Unknown=0, NotChecked=0, Total=462 [2019-11-16 00:12:29,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-11-16 00:12:29,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2019-11-16 00:12:29,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-11-16 00:12:29,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 133 transitions. [2019-11-16 00:12:29,466 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 133 transitions. Word has length 41 [2019-11-16 00:12:29,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:12:29,466 INFO L462 AbstractCegarLoop]: Abstraction has 126 states and 133 transitions. [2019-11-16 00:12:29,466 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-16 00:12:29,466 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 133 transitions. [2019-11-16 00:12:29,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-16 00:12:29,467 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:12:29,467 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:12:29,670 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:12:29,670 INFO L410 AbstractCegarLoop]: === Iteration 25 === [mainErr20REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr64REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr67ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr66ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr65REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr71ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr72ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION]=== [2019-11-16 00:12:29,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:12:29,671 INFO L82 PathProgramCache]: Analyzing trace with hash -311646077, now seen corresponding path program 1 times [2019-11-16 00:12:29,671 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:12:29,671 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289269819] [2019-11-16 00:12:29,671 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:29,671 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:29,671 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:12:29,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:29,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:29,892 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:12:29,892 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289269819] [2019-11-16 00:12:29,892 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2003296689] [2019-11-16 00:12:29,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f986349c-add1-4cc4-8da0-7c80cbe320c6/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:12:30,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:30,039 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 51 conjunts are in the unsatisfiable core [2019-11-16 00:12:30,050 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:12:30,174 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:12:30,175 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-16 00:12:30,176 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:12:30,216 INFO L567 ElimStorePlain]: treesize reduction 14, result has 68.2 percent of original size [2019-11-16 00:12:30,216 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:12:30,216 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:30 [2019-11-16 00:12:30,271 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-16 00:12:30,271 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:12:30,300 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:12:30,304 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-16 00:12:30,304 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:12:30,323 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:12:30,323 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:12:30,323 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:49, output treesize:42 [2019-11-16 00:12:30,419 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2019-11-16 00:12:30,419 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:12:30,446 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:12:30,469 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:12:30,469 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 66 [2019-11-16 00:12:30,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:30,472 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-11-16 00:12:30,521 INFO L567 ElimStorePlain]: treesize reduction 48, result has 59.0 percent of original size [2019-11-16 00:12:30,522 INFO L496 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-11-16 00:12:30,522 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:84, output treesize:68 [2019-11-16 00:12:30,586 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 10 [2019-11-16 00:12:30,586 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:12:30,600 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:12:30,600 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:12:30,600 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:69, output treesize:45 [2019-11-16 00:12:30,737 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:12:30,738 INFO L375 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 99 [2019-11-16 00:12:30,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:30,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:30,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:12:30,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:30,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:30,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:30,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:30,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:30,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:12:30,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:30,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:30,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:30,753 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:12:30,832 INFO L567 ElimStorePlain]: treesize reduction 46, result has 57.0 percent of original size [2019-11-16 00:12:30,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:30,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:30,834 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-16 00:12:30,834 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:56, output treesize:61 [2019-11-16 00:12:30,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:30,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:30,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:30,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:30,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:30,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:31,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:31,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:31,053 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:12:31,066 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 44 [2019-11-16 00:12:31,066 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:12:31,080 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:12:31,157 INFO L341 Elim1Store]: treesize reduction 28, result has 67.4 percent of original size [2019-11-16 00:12:31,157 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 71 treesize of output 104 [2019-11-16 00:12:31,158 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:12:31,178 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:12:31,182 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 49 [2019-11-16 00:12:31,183 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-16 00:12:31,356 WARN L191 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 47 [2019-11-16 00:12:31,357 INFO L567 ElimStorePlain]: treesize reduction 76, result has 63.8 percent of original size [2019-11-16 00:12:31,358 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2019-11-16 00:12:31,358 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:191, output treesize:134 [2019-11-16 00:12:31,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:31,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:31,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:31,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:31,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:31,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:31,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:31,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:31,886 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2019-11-16 00:12:32,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:12:32,050 INFO L392 ElimStorePlain]: Different costs {0=[v_prenex_8], 1=[|#memory_$Pointer$.offset|, v_prenex_4, v_prenex_5], 2=[v_prenex_7], 5=[|#memory_$Pointer$.base|]} [2019-11-16 00:12:32,057 INFO L375 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 82 treesize of output 62 [2019-11-16 00:12:32,057 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:12:32,115 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:12:32,127 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:12:32,127 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 67 [2019-11-16 00:12:32,128 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:12:32,181 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:12:32,196 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:12:32,197 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 49 [2019-11-16 00:12:32,197 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-16 00:12:32,308 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 67 [2019-11-16 00:12:32,308 INFO L567 ElimStorePlain]: treesize reduction 8, result has 95.0 percent of original size [2019-11-16 00:12:32,314 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 24 [2019-11-16 00:12:32,314 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-16 00:12:32,352 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:12:32,362 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:12:32,362 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 44 [2019-11-16 00:12:32,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:32,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:32,364 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:12:32,435 INFO L567 ElimStorePlain]: treesize reduction 14, result has 88.1 percent of original size [2019-11-16 00:12:32,455 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:12:32,456 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 74 [2019-11-16 00:12:32,456 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-16 00:12:32,537 INFO L567 ElimStorePlain]: treesize reduction 14, result has 86.7 percent of original size [2019-11-16 00:12:32,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:32,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:32,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:32,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:32,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:32,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:32,541 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 6 dim-2 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. [2019-11-16 00:12:32,542 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 12 variables, input treesize:212, output treesize:91 [2019-11-16 00:12:32,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:32,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:32,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:32,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:32,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:32,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:32,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:32,769 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:12:32,769 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:12:32,770 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 18] total 30 [2019-11-16 00:12:32,770 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802088166] [2019-11-16 00:12:32,770 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-11-16 00:12:32,771 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:12:32,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-11-16 00:12:32,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=773, Unknown=0, NotChecked=0, Total=930 [2019-11-16 00:12:32,771 INFO L87 Difference]: Start difference. First operand 126 states and 133 transitions. Second operand 31 states. [2019-11-16 00:12:33,645 WARN L191 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 74 [2019-11-16 00:12:34,054 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 73 [2019-11-16 00:12:34,458 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 66 [2019-11-16 00:12:34,824 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 69 [2019-11-16 00:12:35,042 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 64 [2019-11-16 00:12:35,542 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 69 [2019-11-16 00:12:35,843 WARN L191 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 69 [2019-11-16 00:12:36,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:12:36,273 INFO L93 Difference]: Finished difference Result 215 states and 229 transitions. [2019-11-16 00:12:36,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-11-16 00:12:36,273 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 49 [2019-11-16 00:12:36,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:12:36,274 INFO L225 Difference]: With dead ends: 215 [2019-11-16 00:12:36,274 INFO L226 Difference]: Without dead ends: 215 [2019-11-16 00:12:36,275 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 28 SyntacticMatches, 7 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 713 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=571, Invalid=2185, Unknown=0, NotChecked=0, Total=2756 [2019-11-16 00:12:36,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-11-16 00:12:36,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 159. [2019-11-16 00:12:36,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2019-11-16 00:12:36,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 170 transitions. [2019-11-16 00:12:36,280 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 170 transitions. Word has length 49 [2019-11-16 00:12:36,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:12:36,280 INFO L462 AbstractCegarLoop]: Abstraction has 159 states and 170 transitions. [2019-11-16 00:12:36,280 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-11-16 00:12:36,280 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 170 transitions. [2019-11-16 00:12:36,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-16 00:12:36,281 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:12:36,281 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:12:36,484 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:12:36,485 INFO L410 AbstractCegarLoop]: === Iteration 26 === [mainErr20REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr64REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr67ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr66ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr65REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr71ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr72ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION]=== [2019-11-16 00:12:36,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:12:36,485 INFO L82 PathProgramCache]: Analyzing trace with hash -311646076, now seen corresponding path program 1 times [2019-11-16 00:12:36,485 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:12:36,485 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480753891] [2019-11-16 00:12:36,486 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:36,486 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:36,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:12:36,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:36,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:36,873 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:12:36,873 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480753891] [2019-11-16 00:12:36,874 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1146920950] [2019-11-16 00:12:36,874 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f986349c-add1-4cc4-8da0-7c80cbe320c6/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:12:37,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:37,028 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 54 conjunts are in the unsatisfiable core [2019-11-16 00:12:37,031 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:12:37,175 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_71|], 1=[|v_#valid_96|]} [2019-11-16 00:12:37,179 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-16 00:12:37,179 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:12:37,195 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:12:37,205 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:12:37,205 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-16 00:12:37,206 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:12:37,229 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:12:37,229 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:12:37,229 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:25 [2019-11-16 00:12:37,276 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-16 00:12:37,276 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:12:37,293 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:12:37,298 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-16 00:12:37,299 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:12:37,316 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:12:37,317 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:12:37,317 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:37 [2019-11-16 00:12:37,414 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2019-11-16 00:12:37,415 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:12:37,434 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:12:37,450 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:12:37,451 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 66 [2019-11-16 00:12:37,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:37,452 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-11-16 00:12:37,485 INFO L567 ElimStorePlain]: treesize reduction 48, result has 57.1 percent of original size [2019-11-16 00:12:37,485 INFO L496 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-11-16 00:12:37,486 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:79, output treesize:63 [2019-11-16 00:12:37,645 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:12:37,645 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 103 [2019-11-16 00:12:37,646 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:12:37,694 INFO L567 ElimStorePlain]: treesize reduction 66, result has 54.2 percent of original size [2019-11-16 00:12:37,726 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:12:37,726 INFO L375 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 108 [2019-11-16 00:12:37,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:37,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:37,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:12:37,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:37,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:37,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:37,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:37,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:37,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:12:37,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:37,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:37,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:37,735 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:12:37,802 INFO L567 ElimStorePlain]: treesize reduction 46, result has 63.2 percent of original size [2019-11-16 00:12:37,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:37,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:37,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:37,805 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-16 00:12:37,805 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:86, output treesize:79 [2019-11-16 00:12:37,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:37,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:37,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:37,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:37,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:37,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:37,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:37,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:37,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:37,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:37,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:38,003 INFO L392 ElimStorePlain]: Different costs {20=[|v_#memory_$Pointer$.base_56|], 30=[|v_#memory_$Pointer$.offset_52|]} [2019-11-16 00:12:38,013 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:12:38,023 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 86 [2019-11-16 00:12:38,023 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:12:38,031 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:12:38,041 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:12:38,041 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 104 treesize of output 87 [2019-11-16 00:12:38,042 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:12:38,048 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:12:38,099 INFO L341 Elim1Store]: treesize reduction 28, result has 67.4 percent of original size [2019-11-16 00:12:38,099 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 112 treesize of output 141 [2019-11-16 00:12:38,100 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-16 00:12:38,312 WARN L191 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 67 [2019-11-16 00:12:38,313 INFO L567 ElimStorePlain]: treesize reduction 98, result has 70.7 percent of original size [2019-11-16 00:12:38,318 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:12:38,325 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 53 [2019-11-16 00:12:38,325 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-16 00:12:38,333 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:12:38,382 INFO L341 Elim1Store]: treesize reduction 36, result has 60.9 percent of original size [2019-11-16 00:12:38,383 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 93 treesize of output 125 [2019-11-16 00:12:38,384 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-16 00:12:38,390 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:12:38,393 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 60 [2019-11-16 00:12:38,393 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-16 00:12:38,533 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 60 [2019-11-16 00:12:38,533 INFO L567 ElimStorePlain]: treesize reduction 54, result has 76.5 percent of original size [2019-11-16 00:12:38,534 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2019-11-16 00:12:38,534 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:316, output treesize:176 [2019-11-16 00:12:38,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:38,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:38,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:38,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:38,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:38,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:38,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:38,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:38,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:38,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:38,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:38,956 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 70 [2019-11-16 00:12:39,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:12:39,290 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:12:39,291 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 62 [2019-11-16 00:12:39,291 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:12:39,339 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:12:39,339 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 82 treesize of output 91 [2019-11-16 00:12:39,340 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:12:39,365 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:12:39,366 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 63 [2019-11-16 00:12:39,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:39,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:39,368 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:12:39,507 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 65 [2019-11-16 00:12:39,507 INFO L567 ElimStorePlain]: treesize reduction 40, result has 78.9 percent of original size [2019-11-16 00:12:39,512 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 25 [2019-11-16 00:12:39,512 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-16 00:12:39,517 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 25 [2019-11-16 00:12:39,517 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-16 00:12:39,718 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:12:39,719 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: java.lang.UnsupportedOperationException: expected NNF at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:307) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.generateProof(TraceAbstractionRefinementEngine.java:184) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: java.lang.UnsupportedOperationException: expected NNF at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:236) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive$TermWalker.walk(NonRecursive.java:139) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:195) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder.(ArrayOccurrenceAnalysis.java:181) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis.(ArrayOccurrenceAnalysis.java:74) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:275) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:253) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:299) ... 21 more [2019-11-16 00:12:39,722 INFO L168 Benchmark]: Toolchain (without parser) took 30353.35 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 425.7 MB). Free memory was 944.7 MB in the beginning and 1.3 GB in the end (delta: -317.4 MB). Peak memory consumption was 108.3 MB. Max. memory is 11.5 GB. [2019-11-16 00:12:39,722 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:12:39,722 INFO L168 Benchmark]: CACSL2BoogieTranslator took 592.58 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -176.3 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. [2019-11-16 00:12:39,723 INFO L168 Benchmark]: Boogie Preprocessor took 89.62 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-16 00:12:39,723 INFO L168 Benchmark]: RCFGBuilder took 829.67 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 70.8 MB). Peak memory consumption was 70.8 MB. Max. memory is 11.5 GB. [2019-11-16 00:12:39,723 INFO L168 Benchmark]: TraceAbstraction took 28837.76 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 287.3 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -217.2 MB). Peak memory consumption was 70.1 MB. Max. memory is 11.5 GB. [2019-11-16 00:12:39,725 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 592.58 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -176.3 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 89.62 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 829.67 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 70.8 MB). Peak memory consumption was 70.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 28837.76 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 287.3 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -217.2 MB). Peak memory consumption was 70.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: java.lang.UnsupportedOperationException: expected NNF de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: java.lang.UnsupportedOperationException: expected NNF: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:307) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-cad4683 [2019-11-16 00:12:41,924 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:12:41,926 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:12:41,936 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:12:41,937 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:12:41,938 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:12:41,939 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:12:41,941 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:12:41,943 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:12:41,944 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:12:41,945 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:12:41,946 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:12:41,946 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:12:41,947 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:12:41,948 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:12:41,949 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:12:41,950 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:12:41,951 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:12:41,953 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:12:41,955 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:12:41,957 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:12:41,958 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:12:41,959 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:12:41,960 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:12:41,962 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:12:41,963 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:12:41,963 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:12:41,964 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:12:41,964 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:12:41,965 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:12:41,965 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:12:41,966 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:12:41,967 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:12:41,967 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:12:41,968 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:12:41,969 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:12:41,969 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:12:41,970 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:12:41,970 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:12:41,971 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:12:41,971 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:12:41,972 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_f986349c-add1-4cc4-8da0-7c80cbe320c6/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-11-16 00:12:41,991 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:12:41,992 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:12:41,993 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:12:41,994 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:12:41,994 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:12:41,994 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:12:41,995 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-16 00:12:41,996 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-16 00:12:41,996 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:12:41,997 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-16 00:12:41,998 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:12:41,998 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-16 00:12:41,998 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-16 00:12:41,998 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-16 00:12:41,999 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-16 00:12:41,999 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-16 00:12:41,999 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-16 00:12:42,000 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-16 00:12:42,000 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:12:42,000 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:12:42,000 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:12:42,001 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-16 00:12:42,001 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-16 00:12:42,001 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:12:42,002 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:12:42,002 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-16 00:12:42,002 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-16 00:12:42,003 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-16 00:12:42,003 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-16 00:12:42,003 INFO L138 SettingsManager]: * Logic for external solver=AUFBV Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_f986349c-add1-4cc4-8da0-7c80cbe320c6/bin/uautomizer 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 -> 3e0675069af96ce2b947856aad4bf6a2d556158b [2019-11-16 00:12:42,060 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:12:42,074 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:12:42,077 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:12:42,079 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:12:42,079 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:12:42,080 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_f986349c-add1-4cc4-8da0-7c80cbe320c6/bin/uautomizer/../../sv-benchmarks/c/forester-heap/dll-rb-sentinel-2.i [2019-11-16 00:12:42,136 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f986349c-add1-4cc4-8da0-7c80cbe320c6/bin/uautomizer/data/98818f6a6/1d002164f4fa46308721f1703c633694/FLAG20df2b0a4 [2019-11-16 00:12:42,616 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:12:42,617 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_f986349c-add1-4cc4-8da0-7c80cbe320c6/sv-benchmarks/c/forester-heap/dll-rb-sentinel-2.i [2019-11-16 00:12:42,631 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f986349c-add1-4cc4-8da0-7c80cbe320c6/bin/uautomizer/data/98818f6a6/1d002164f4fa46308721f1703c633694/FLAG20df2b0a4 [2019-11-16 00:12:42,936 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_f986349c-add1-4cc4-8da0-7c80cbe320c6/bin/uautomizer/data/98818f6a6/1d002164f4fa46308721f1703c633694 [2019-11-16 00:12:42,938 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:12:42,939 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-16 00:12:42,940 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:12:42,940 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:12:42,944 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:12:42,944 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:12:42" (1/1) ... [2019-11-16 00:12:42,947 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19b0e1e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:12:42, skipping insertion in model container [2019-11-16 00:12:42,947 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:12:42" (1/1) ... [2019-11-16 00:12:42,955 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:12:42,990 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:12:43,395 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:12:43,413 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:12:43,494 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:12:43,558 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:12:43,559 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:12:43 WrapperNode [2019-11-16 00:12:43,559 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:12:43,560 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:12:43,560 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:12:43,560 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:12:43,570 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:12:43" (1/1) ... [2019-11-16 00:12:43,570 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:12:43" (1/1) ... [2019-11-16 00:12:43,593 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:12:43" (1/1) ... [2019-11-16 00:12:43,593 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:12:43" (1/1) ... [2019-11-16 00:12:43,618 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:12:43" (1/1) ... [2019-11-16 00:12:43,625 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:12:43" (1/1) ... [2019-11-16 00:12:43,630 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:12:43" (1/1) ... [2019-11-16 00:12:43,639 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:12:43,639 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:12:43,639 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:12:43,640 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:12:43,641 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:12:43" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f986349c-add1-4cc4-8da0-7c80cbe320c6/bin/uautomizer/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-11-16 00:12:43,697 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-16 00:12:43,697 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:12:43,698 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-16 00:12:43,698 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-16 00:12:43,698 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-16 00:12:43,698 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-16 00:12:43,699 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-16 00:12:43,699 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-16 00:12:43,699 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-16 00:12:43,699 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-16 00:12:43,699 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-16 00:12:43,700 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-16 00:12:43,700 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-16 00:12:43,700 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-16 00:12:43,700 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-16 00:12:43,701 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-16 00:12:43,701 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-16 00:12:43,701 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-16 00:12:43,701 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-16 00:12:43,702 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-16 00:12:43,702 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-16 00:12:43,702 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-16 00:12:43,702 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-16 00:12:43,703 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-16 00:12:43,703 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-16 00:12:43,703 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-16 00:12:43,703 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-16 00:12:43,704 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-16 00:12:43,704 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-16 00:12:43,704 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-16 00:12:43,704 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-16 00:12:43,704 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-16 00:12:43,705 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-16 00:12:43,705 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-16 00:12:43,707 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-16 00:12:43,707 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-16 00:12:43,708 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-16 00:12:43,708 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-16 00:12:43,708 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-16 00:12:43,709 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-16 00:12:43,709 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-16 00:12:43,709 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-16 00:12:43,709 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-16 00:12:43,710 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-16 00:12:43,710 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-16 00:12:43,710 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-16 00:12:43,710 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-16 00:12:43,710 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-16 00:12:43,711 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-16 00:12:43,711 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-16 00:12:43,711 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-16 00:12:43,712 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-16 00:12:43,712 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-16 00:12:43,712 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-16 00:12:43,713 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-16 00:12:43,713 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-16 00:12:43,713 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-16 00:12:43,714 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-16 00:12:43,714 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-16 00:12:43,714 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-16 00:12:43,715 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-16 00:12:43,715 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-16 00:12:43,715 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-16 00:12:43,716 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-16 00:12:43,716 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-16 00:12:43,716 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-16 00:12:43,716 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-16 00:12:43,717 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-16 00:12:43,718 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-16 00:12:43,718 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-16 00:12:43,719 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-16 00:12:43,719 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-16 00:12:43,720 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-16 00:12:43,721 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-16 00:12:43,722 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-16 00:12:43,722 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-16 00:12:43,723 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-16 00:12:43,723 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-16 00:12:43,723 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-16 00:12:43,724 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-16 00:12:43,724 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-16 00:12:43,724 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-16 00:12:43,725 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-16 00:12:43,726 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-16 00:12:43,726 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-16 00:12:43,726 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-16 00:12:43,726 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-16 00:12:43,726 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-16 00:12:43,727 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-16 00:12:43,727 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-16 00:12:43,727 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-16 00:12:43,727 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-16 00:12:43,727 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-16 00:12:43,728 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-16 00:12:43,728 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-16 00:12:43,728 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-16 00:12:43,728 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-16 00:12:43,728 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-16 00:12:43,729 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-16 00:12:43,729 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-16 00:12:43,729 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-16 00:12:43,729 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-16 00:12:43,729 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-16 00:12:43,730 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-16 00:12:43,730 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-16 00:12:43,730 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-16 00:12:43,730 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-16 00:12:43,730 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-16 00:12:43,731 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-16 00:12:43,731 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-16 00:12:43,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-16 00:12:43,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-16 00:12:43,731 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-16 00:12:43,732 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-16 00:12:43,732 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-16 00:12:43,732 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-16 00:12:43,732 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:12:44,865 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:12:44,865 INFO L284 CfgBuilder]: Removed 17 assume(true) statements. [2019-11-16 00:12:44,866 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:12:44 BoogieIcfgContainer [2019-11-16 00:12:44,867 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:12:44,868 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-16 00:12:44,868 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-16 00:12:44,871 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-16 00:12:44,871 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:12:42" (1/3) ... [2019-11-16 00:12:44,872 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f41295a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:12:44, skipping insertion in model container [2019-11-16 00:12:44,872 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:12:43" (2/3) ... [2019-11-16 00:12:44,873 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f41295a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:12:44, skipping insertion in model container [2019-11-16 00:12:44,873 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:12:44" (3/3) ... [2019-11-16 00:12:44,877 INFO L109 eAbstractionObserver]: Analyzing ICFG dll-rb-sentinel-2.i [2019-11-16 00:12:44,888 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-16 00:12:44,900 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 73 error locations. [2019-11-16 00:12:44,911 INFO L249 AbstractCegarLoop]: Starting to check reachability of 73 error locations. [2019-11-16 00:12:44,931 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-16 00:12:44,931 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-16 00:12:44,931 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-16 00:12:44,932 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:12:44,932 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:12:44,932 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-16 00:12:44,932 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:12:44,933 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-16 00:12:44,961 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states. [2019-11-16 00:12:44,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-16 00:12:44,980 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:12:44,981 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:12:44,984 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr72ENSURES_VIOLATIONMEMORY_LEAK, mainErr29REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr65REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr42REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr71ASSERT_VIOLATIONMEMORY_FREE, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr66ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr64REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr67ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION]=== [2019-11-16 00:12:44,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:12:44,989 INFO L82 PathProgramCache]: Analyzing trace with hash 685883881, now seen corresponding path program 1 times [2019-11-16 00:12:44,999 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:12:44,999 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1359763126] [2019-11-16 00:12:45,000 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f986349c-add1-4cc4-8da0-7c80cbe320c6/bin/uautomizer/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-11-16 00:12:45,220 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:12:45,221 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Sort C_DOUBLE not declared at de.uni_freiburg.informatik.ultimate.logic.NoopScript.sort(NoopScript.java:412) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.sort(WrapperScript.java:223) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.NonDeclaringTermTransferrer.transferSort(NonDeclaringTermTransferrer.java:111) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.DeclarableFunctionSymbol.defineOrDeclare(DeclarableFunctionSymbol.java:160) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.transferHistoryFromRecord(HistoryRecordingScript.java:143) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.transferHistoryFromRecord(HistoryRecordingScript.java:168) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.SmtFunctionsAndAxioms.transferSymbols(SmtFunctionsAndAxioms.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleTraceCheck.createExternalManagedScript(IpTcStrategyModuleTraceCheck.java:81) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCvc4.constructManagedScript(IpTcStrategyModuleCvc4.java:95) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.checkFeasibility(TraceAbstractionRefinementEngine.java:244) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-16 00:12:45,225 INFO L168 Benchmark]: Toolchain (without parser) took 2285.21 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 150.5 MB). Free memory was 937.6 MB in the beginning and 1.0 GB in the end (delta: -95.0 MB). Peak memory consumption was 55.5 MB. Max. memory is 11.5 GB. [2019-11-16 00:12:45,226 INFO L168 Benchmark]: CDTParser took 0.79 ms. Allocated memory is still 1.0 GB. Free memory is still 972.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:12:45,227 INFO L168 Benchmark]: CACSL2BoogieTranslator took 619.75 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 150.5 MB). Free memory was 937.6 MB in the beginning and 1.1 GB in the end (delta: -182.7 MB). Peak memory consumption was 23.5 MB. Max. memory is 11.5 GB. [2019-11-16 00:12:45,227 INFO L168 Benchmark]: Boogie Preprocessor took 78.91 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-11-16 00:12:45,228 INFO L168 Benchmark]: RCFGBuilder took 1227.52 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: 69.3 MB). Peak memory consumption was 69.3 MB. Max. memory is 11.5 GB. [2019-11-16 00:12:45,228 INFO L168 Benchmark]: TraceAbstraction took 355.26 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 18.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-11-16 00:12:45,231 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.79 ms. Allocated memory is still 1.0 GB. Free memory is still 972.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 619.75 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 150.5 MB). Free memory was 937.6 MB in the beginning and 1.1 GB in the end (delta: -182.7 MB). Peak memory consumption was 23.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 78.91 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 1227.52 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: 69.3 MB). Peak memory consumption was 69.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 355.26 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 18.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: Sort C_DOUBLE not declared de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Sort C_DOUBLE not declared: de.uni_freiburg.informatik.ultimate.logic.NoopScript.sort(NoopScript.java:412) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...