./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../../sv-benchmarks/c/forester-heap/sll-rb-sentinel-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) 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_37a8eefb-eaae-47ec-a330-6064ca78fc56/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_37a8eefb-eaae-47ec-a330-6064ca78fc56/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_37a8eefb-eaae-47ec-a330-6064ca78fc56/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_37a8eefb-eaae-47ec-a330-6064ca78fc56/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/sll-rb-sentinel-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_37a8eefb-eaae-47ec-a330-6064ca78fc56/bin/uautomizer/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_37a8eefb-eaae-47ec-a330-6064ca78fc56/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d9f9c3b0fdd5428a38e0eab9236fadbdbb3aa880 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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_37a8eefb-eaae-47ec-a330-6064ca78fc56/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_37a8eefb-eaae-47ec-a330-6064ca78fc56/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_37a8eefb-eaae-47ec-a330-6064ca78fc56/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_37a8eefb-eaae-47ec-a330-6064ca78fc56/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/sll-rb-sentinel-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_37a8eefb-eaae-47ec-a330-6064ca78fc56/bin/uautomizer/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_37a8eefb-eaae-47ec-a330-6064ca78fc56/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d9f9c3b0fdd5428a38e0eab9236fadbdbb3aa880 .................................................................................................................................................................................................................................................................................................................................................. 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-15 19:54:16,443 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 19:54:16,444 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 19:54:16,457 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 19:54:16,457 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 19:54:16,458 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 19:54:16,460 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 19:54:16,462 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 19:54:16,473 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 19:54:16,475 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 19:54:16,476 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 19:54:16,477 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 19:54:16,477 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 19:54:16,478 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 19:54:16,479 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 19:54:16,480 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 19:54:16,481 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 19:54:16,482 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 19:54:16,484 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 19:54:16,492 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 19:54:16,497 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 19:54:16,501 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 19:54:16,505 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 19:54:16,506 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 19:54:16,511 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 19:54:16,512 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 19:54:16,513 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 19:54:16,515 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 19:54:16,515 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 19:54:16,517 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 19:54:16,517 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 19:54:16,518 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 19:54:16,520 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 19:54:16,520 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 19:54:16,522 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 19:54:16,523 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 19:54:16,523 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 19:54:16,524 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 19:54:16,524 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 19:54:16,525 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 19:54:16,526 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 19:54:16,526 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_37a8eefb-eaae-47ec-a330-6064ca78fc56/bin/uautomizer/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2019-11-15 19:54:16,563 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 19:54:16,563 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 19:54:16,564 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 19:54:16,564 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 19:54:16,564 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 19:54:16,565 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 19:54:16,565 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 19:54:16,565 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 19:54:16,565 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 19:54:16,565 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 19:54:16,566 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 19:54:16,566 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-15 19:54:16,566 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-15 19:54:16,566 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 19:54:16,567 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 19:54:16,567 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 19:54:16,567 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 19:54:16,567 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 19:54:16,567 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 19:54:16,568 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 19:54:16,568 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 19:54:16,568 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 19:54:16,568 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 19:54:16,569 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 19:54:16,569 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 19:54:16,569 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_37a8eefb-eaae-47ec-a330-6064ca78fc56/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-memcleanup) ) 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 -> d9f9c3b0fdd5428a38e0eab9236fadbdbb3aa880 [2019-11-15 19:54:16,598 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 19:54:16,611 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 19:54:16,614 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 19:54:16,616 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 19:54:16,616 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 19:54:16,617 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_37a8eefb-eaae-47ec-a330-6064ca78fc56/bin/uautomizer/../../sv-benchmarks/c/forester-heap/sll-rb-sentinel-2.i [2019-11-15 19:54:16,681 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_37a8eefb-eaae-47ec-a330-6064ca78fc56/bin/uautomizer/data/ddb1744d5/b1ef9d46c6da462f89f8297b03328982/FLAG563e0e2f2 [2019-11-15 19:54:17,180 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 19:54:17,181 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_37a8eefb-eaae-47ec-a330-6064ca78fc56/sv-benchmarks/c/forester-heap/sll-rb-sentinel-2.i [2019-11-15 19:54:17,197 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_37a8eefb-eaae-47ec-a330-6064ca78fc56/bin/uautomizer/data/ddb1744d5/b1ef9d46c6da462f89f8297b03328982/FLAG563e0e2f2 [2019-11-15 19:54:17,458 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_37a8eefb-eaae-47ec-a330-6064ca78fc56/bin/uautomizer/data/ddb1744d5/b1ef9d46c6da462f89f8297b03328982 [2019-11-15 19:54:17,462 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 19:54:17,463 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-15 19:54:17,472 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 19:54:17,473 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 19:54:17,477 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 19:54:17,493 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 07:54:17" (1/1) ... [2019-11-15 19:54:17,497 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c5439c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:54:17, skipping insertion in model container [2019-11-15 19:54:17,497 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 07:54:17" (1/1) ... [2019-11-15 19:54:17,523 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 19:54:17,595 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 19:54:18,095 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 19:54:18,106 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 19:54:18,152 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 19:54:18,204 INFO L192 MainTranslator]: Completed translation [2019-11-15 19:54:18,205 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:54:18 WrapperNode [2019-11-15 19:54:18,205 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 19:54:18,206 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 19:54:18,206 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 19:54:18,206 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 19:54:18,220 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:54:18" (1/1) ... [2019-11-15 19:54:18,221 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:54:18" (1/1) ... [2019-11-15 19:54:18,238 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:54:18" (1/1) ... [2019-11-15 19:54:18,239 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:54:18" (1/1) ... [2019-11-15 19:54:18,265 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:54:18" (1/1) ... [2019-11-15 19:54:18,272 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:54:18" (1/1) ... [2019-11-15 19:54:18,276 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:54:18" (1/1) ... [2019-11-15 19:54:18,283 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 19:54:18,284 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 19:54:18,284 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 19:54:18,284 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 19:54:18,285 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:54:18" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_37a8eefb-eaae-47ec-a330-6064ca78fc56/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-15 19:54:18,347 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-15 19:54:18,347 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 19:54:18,348 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-15 19:54:18,348 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-15 19:54:18,348 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-15 19:54:18,349 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-15 19:54:18,349 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-15 19:54:18,349 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-15 19:54:18,349 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-15 19:54:18,349 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-15 19:54:18,350 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-15 19:54:18,350 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-15 19:54:18,350 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-15 19:54:18,350 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-15 19:54:18,351 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-15 19:54:18,351 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-15 19:54:18,351 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-15 19:54:18,351 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-15 19:54:18,351 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-15 19:54:18,352 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-15 19:54:18,352 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-15 19:54:18,352 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-15 19:54:18,352 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-15 19:54:18,353 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-15 19:54:18,353 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-15 19:54:18,353 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-15 19:54:18,353 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-15 19:54:18,354 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-15 19:54:18,354 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-15 19:54:18,354 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-15 19:54:18,354 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-15 19:54:18,354 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-15 19:54:18,355 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-15 19:54:18,355 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-15 19:54:18,355 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-15 19:54:18,355 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-15 19:54:18,355 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-15 19:54:18,356 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-15 19:54:18,356 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-15 19:54:18,356 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-15 19:54:18,356 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-15 19:54:18,356 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-15 19:54:18,357 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-15 19:54:18,357 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-15 19:54:18,357 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-15 19:54:18,357 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-15 19:54:18,357 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-15 19:54:18,358 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-15 19:54:18,358 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-15 19:54:18,358 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-15 19:54:18,358 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-15 19:54:18,358 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-15 19:54:18,359 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-15 19:54:18,359 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-15 19:54:18,359 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-15 19:54:18,359 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-15 19:54:18,360 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-15 19:54:18,360 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-15 19:54:18,360 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-15 19:54:18,360 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-15 19:54:18,360 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-15 19:54:18,361 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-15 19:54:18,361 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-15 19:54:18,361 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-15 19:54:18,361 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-15 19:54:18,362 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-15 19:54:18,362 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-15 19:54:18,362 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-15 19:54:18,362 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-15 19:54:18,362 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-15 19:54:18,363 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-15 19:54:18,363 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-15 19:54:18,363 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-15 19:54:18,363 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-15 19:54:18,364 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-15 19:54:18,364 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-15 19:54:18,364 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-15 19:54:18,364 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-15 19:54:18,365 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-15 19:54:18,365 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-15 19:54:18,365 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-15 19:54:18,365 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-15 19:54:18,366 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-15 19:54:18,366 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-15 19:54:18,366 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-15 19:54:18,366 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-15 19:54:18,366 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-15 19:54:18,367 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-15 19:54:18,367 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-15 19:54:18,367 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-15 19:54:18,367 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-15 19:54:18,368 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-15 19:54:18,368 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-15 19:54:18,368 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-15 19:54:18,368 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-15 19:54:18,369 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-15 19:54:18,369 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-15 19:54:18,369 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-15 19:54:18,369 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-15 19:54:18,369 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-15 19:54:18,370 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-15 19:54:18,370 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-15 19:54:18,370 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-15 19:54:18,370 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-15 19:54:18,370 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-15 19:54:18,371 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-15 19:54:18,371 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-15 19:54:18,371 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-15 19:54:18,371 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-15 19:54:18,372 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-15 19:54:18,372 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 19:54:18,372 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-15 19:54:18,372 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-15 19:54:18,373 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 19:54:18,373 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 19:54:18,373 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-15 19:54:18,373 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 19:54:19,113 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 19:54:19,113 INFO L284 CfgBuilder]: Removed 11 assume(true) statements. [2019-11-15 19:54:19,115 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 07:54:19 BoogieIcfgContainer [2019-11-15 19:54:19,115 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 19:54:19,116 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 19:54:19,116 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 19:54:19,120 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 19:54:19,120 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 07:54:17" (1/3) ... [2019-11-15 19:54:19,121 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4430184b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 07:54:19, skipping insertion in model container [2019-11-15 19:54:19,121 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:54:18" (2/3) ... [2019-11-15 19:54:19,122 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4430184b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 07:54:19, skipping insertion in model container [2019-11-15 19:54:19,122 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 07:54:19" (3/3) ... [2019-11-15 19:54:19,124 INFO L109 eAbstractionObserver]: Analyzing ICFG sll-rb-sentinel-2.i [2019-11-15 19:54:19,135 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 19:54:19,150 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 57 error locations. [2019-11-15 19:54:19,162 INFO L249 AbstractCegarLoop]: Starting to check reachability of 57 error locations. [2019-11-15 19:54:19,181 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 19:54:19,181 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-15 19:54:19,181 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 19:54:19,182 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 19:54:19,182 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 19:54:19,182 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 19:54:19,182 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 19:54:19,182 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 19:54:19,204 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states. [2019-11-15 19:54:19,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-15 19:54:19,215 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:54:19,216 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:54:19,218 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr56ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION]=== [2019-11-15 19:54:19,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:54:19,224 INFO L82 PathProgramCache]: Analyzing trace with hash -424449852, now seen corresponding path program 1 times [2019-11-15 19:54:19,234 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:54:19,234 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695328280] [2019-11-15 19:54:19,234 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:19,234 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:19,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:54:19,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:54:19,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:54:19,442 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-15 19:54:19,443 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695328280] [2019-11-15 19:54:19,444 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:54:19,444 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 19:54:19,445 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129832060] [2019-11-15 19:54:19,450 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 19:54:19,451 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:54:19,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 19:54:19,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 19:54:19,469 INFO L87 Difference]: Start difference. First operand 128 states. Second operand 4 states. [2019-11-15 19:54:20,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:54:20,015 INFO L93 Difference]: Finished difference Result 156 states and 163 transitions. [2019-11-15 19:54:20,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 19:54:20,017 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-11-15 19:54:20,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:54:20,030 INFO L225 Difference]: With dead ends: 156 [2019-11-15 19:54:20,030 INFO L226 Difference]: Without dead ends: 153 [2019-11-15 19:54:20,032 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-15 19:54:20,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-11-15 19:54:20,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 127. [2019-11-15 19:54:20,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-11-15 19:54:20,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 135 transitions. [2019-11-15 19:54:20,107 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 135 transitions. Word has length 7 [2019-11-15 19:54:20,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:54:20,107 INFO L462 AbstractCegarLoop]: Abstraction has 127 states and 135 transitions. [2019-11-15 19:54:20,107 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 19:54:20,107 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 135 transitions. [2019-11-15 19:54:20,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-15 19:54:20,108 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:54:20,108 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:54:20,109 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr56ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION]=== [2019-11-15 19:54:20,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:54:20,109 INFO L82 PathProgramCache]: Analyzing trace with hash -424449851, now seen corresponding path program 1 times [2019-11-15 19:54:20,109 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:54:20,110 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983640601] [2019-11-15 19:54:20,110 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:20,110 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:20,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:54:20,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:54:20,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:54:20,211 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-15 19:54:20,211 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983640601] [2019-11-15 19:54:20,211 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:54:20,211 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 19:54:20,212 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148938782] [2019-11-15 19:54:20,219 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 19:54:20,220 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:54:20,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 19:54:20,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 19:54:20,221 INFO L87 Difference]: Start difference. First operand 127 states and 135 transitions. Second operand 4 states. [2019-11-15 19:54:20,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:54:20,626 INFO L93 Difference]: Finished difference Result 124 states and 131 transitions. [2019-11-15 19:54:20,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 19:54:20,627 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-11-15 19:54:20,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:54:20,628 INFO L225 Difference]: With dead ends: 124 [2019-11-15 19:54:20,628 INFO L226 Difference]: Without dead ends: 124 [2019-11-15 19:54:20,629 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-15 19:54:20,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-11-15 19:54:20,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2019-11-15 19:54:20,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-11-15 19:54:20,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 131 transitions. [2019-11-15 19:54:20,652 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 131 transitions. Word has length 7 [2019-11-15 19:54:20,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:54:20,653 INFO L462 AbstractCegarLoop]: Abstraction has 124 states and 131 transitions. [2019-11-15 19:54:20,653 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 19:54:20,653 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 131 transitions. [2019-11-15 19:54:20,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-15 19:54:20,654 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:54:20,654 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:54:20,655 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr56ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION]=== [2019-11-15 19:54:20,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:54:20,655 INFO L82 PathProgramCache]: Analyzing trace with hash -401845243, now seen corresponding path program 1 times [2019-11-15 19:54:20,656 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:54:20,656 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728610332] [2019-11-15 19:54:20,656 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:20,656 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:20,657 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:54:20,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:54:20,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:54:20,784 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-15 19:54:20,784 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728610332] [2019-11-15 19:54:20,785 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:54:20,785 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 19:54:20,785 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208468092] [2019-11-15 19:54:20,786 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 19:54:20,786 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:54:20,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 19:54:20,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 19:54:20,787 INFO L87 Difference]: Start difference. First operand 124 states and 131 transitions. Second operand 4 states. [2019-11-15 19:54:21,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:54:21,141 INFO L93 Difference]: Finished difference Result 121 states and 127 transitions. [2019-11-15 19:54:21,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 19:54:21,143 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-15 19:54:21,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:54:21,144 INFO L225 Difference]: With dead ends: 121 [2019-11-15 19:54:21,145 INFO L226 Difference]: Without dead ends: 121 [2019-11-15 19:54:21,145 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-15 19:54:21,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-11-15 19:54:21,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 119. [2019-11-15 19:54:21,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-11-15 19:54:21,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 127 transitions. [2019-11-15 19:54:21,160 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 127 transitions. Word has length 10 [2019-11-15 19:54:21,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:54:21,160 INFO L462 AbstractCegarLoop]: Abstraction has 119 states and 127 transitions. [2019-11-15 19:54:21,161 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 19:54:21,161 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 127 transitions. [2019-11-15 19:54:21,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-15 19:54:21,162 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:54:21,162 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:54:21,163 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr56ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION]=== [2019-11-15 19:54:21,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:54:21,163 INFO L82 PathProgramCache]: Analyzing trace with hash -401845242, now seen corresponding path program 1 times [2019-11-15 19:54:21,164 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:54:21,164 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183133443] [2019-11-15 19:54:21,164 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:21,164 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:21,165 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:54:21,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:54:21,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:54:21,249 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-15 19:54:21,250 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183133443] [2019-11-15 19:54:21,250 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:54:21,250 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 19:54:21,250 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682595501] [2019-11-15 19:54:21,251 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 19:54:21,251 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:54:21,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 19:54:21,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 19:54:21,252 INFO L87 Difference]: Start difference. First operand 119 states and 127 transitions. Second operand 4 states. [2019-11-15 19:54:21,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:54:21,579 INFO L93 Difference]: Finished difference Result 137 states and 143 transitions. [2019-11-15 19:54:21,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 19:54:21,579 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-15 19:54:21,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:54:21,581 INFO L225 Difference]: With dead ends: 137 [2019-11-15 19:54:21,581 INFO L226 Difference]: Without dead ends: 137 [2019-11-15 19:54:21,581 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-15 19:54:21,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-11-15 19:54:21,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 124. [2019-11-15 19:54:21,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-11-15 19:54:21,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 132 transitions. [2019-11-15 19:54:21,591 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 132 transitions. Word has length 10 [2019-11-15 19:54:21,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:54:21,591 INFO L462 AbstractCegarLoop]: Abstraction has 124 states and 132 transitions. [2019-11-15 19:54:21,591 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 19:54:21,591 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 132 transitions. [2019-11-15 19:54:21,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-15 19:54:21,592 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:54:21,592 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:54:21,593 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr56ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION]=== [2019-11-15 19:54:21,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:54:21,593 INFO L82 PathProgramCache]: Analyzing trace with hash -1642440688, now seen corresponding path program 1 times [2019-11-15 19:54:21,594 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:54:21,594 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405820106] [2019-11-15 19:54:21,594 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:21,594 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:21,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:54:21,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:54:21,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:54:21,714 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-15 19:54:21,714 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405820106] [2019-11-15 19:54:21,714 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:54:21,715 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 19:54:21,715 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730837103] [2019-11-15 19:54:21,715 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 19:54:21,715 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:54:21,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 19:54:21,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 19:54:21,716 INFO L87 Difference]: Start difference. First operand 124 states and 132 transitions. Second operand 5 states. [2019-11-15 19:54:22,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:54:22,092 INFO L93 Difference]: Finished difference Result 128 states and 138 transitions. [2019-11-15 19:54:22,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 19:54:22,096 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-11-15 19:54:22,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:54:22,097 INFO L225 Difference]: With dead ends: 128 [2019-11-15 19:54:22,097 INFO L226 Difference]: Without dead ends: 128 [2019-11-15 19:54:22,098 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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-15 19:54:22,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-11-15 19:54:22,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 115. [2019-11-15 19:54:22,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-11-15 19:54:22,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 125 transitions. [2019-11-15 19:54:22,107 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 125 transitions. Word has length 15 [2019-11-15 19:54:22,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:54:22,107 INFO L462 AbstractCegarLoop]: Abstraction has 115 states and 125 transitions. [2019-11-15 19:54:22,107 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 19:54:22,108 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 125 transitions. [2019-11-15 19:54:22,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-15 19:54:22,108 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:54:22,109 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:54:22,109 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr56ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION]=== [2019-11-15 19:54:22,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:54:22,110 INFO L82 PathProgramCache]: Analyzing trace with hash -1642440687, now seen corresponding path program 1 times [2019-11-15 19:54:22,110 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:54:22,110 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238227308] [2019-11-15 19:54:22,111 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:22,111 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:22,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:54:22,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:54:22,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:54:22,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 19:54:22,216 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238227308] [2019-11-15 19:54:22,216 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:54:22,222 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 19:54:22,222 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169369336] [2019-11-15 19:54:22,223 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 19:54:22,223 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:54:22,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 19:54:22,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 19:54:22,224 INFO L87 Difference]: Start difference. First operand 115 states and 125 transitions. Second operand 5 states. [2019-11-15 19:54:22,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:54:22,536 INFO L93 Difference]: Finished difference Result 151 states and 161 transitions. [2019-11-15 19:54:22,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 19:54:22,537 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-11-15 19:54:22,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:54:22,538 INFO L225 Difference]: With dead ends: 151 [2019-11-15 19:54:22,538 INFO L226 Difference]: Without dead ends: 151 [2019-11-15 19:54:22,539 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 19:54:22,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-11-15 19:54:22,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 121. [2019-11-15 19:54:22,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-11-15 19:54:22,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 132 transitions. [2019-11-15 19:54:22,547 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 132 transitions. Word has length 15 [2019-11-15 19:54:22,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:54:22,547 INFO L462 AbstractCegarLoop]: Abstraction has 121 states and 132 transitions. [2019-11-15 19:54:22,548 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 19:54:22,548 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 132 transitions. [2019-11-15 19:54:22,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-15 19:54:22,548 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:54:22,549 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:54:22,549 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr56ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION]=== [2019-11-15 19:54:22,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:54:22,550 INFO L82 PathProgramCache]: Analyzing trace with hash -1683100079, now seen corresponding path program 1 times [2019-11-15 19:54:22,550 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:54:22,550 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313375965] [2019-11-15 19:54:22,550 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:22,551 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:22,551 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:54:22,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:54:22,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:54:22,634 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-15 19:54:22,635 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313375965] [2019-11-15 19:54:22,635 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:54:22,635 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 19:54:22,635 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764492499] [2019-11-15 19:54:22,636 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 19:54:22,636 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:54:22,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 19:54:22,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 19:54:22,637 INFO L87 Difference]: Start difference. First operand 121 states and 132 transitions. Second operand 7 states. [2019-11-15 19:54:23,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:54:23,225 INFO L93 Difference]: Finished difference Result 190 states and 211 transitions. [2019-11-15 19:54:23,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 19:54:23,226 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2019-11-15 19:54:23,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:54:23,228 INFO L225 Difference]: With dead ends: 190 [2019-11-15 19:54:23,228 INFO L226 Difference]: Without dead ends: 190 [2019-11-15 19:54:23,229 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-11-15 19:54:23,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-11-15 19:54:23,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 120. [2019-11-15 19:54:23,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-11-15 19:54:23,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 131 transitions. [2019-11-15 19:54:23,237 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 131 transitions. Word has length 18 [2019-11-15 19:54:23,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:54:23,238 INFO L462 AbstractCegarLoop]: Abstraction has 120 states and 131 transitions. [2019-11-15 19:54:23,238 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 19:54:23,238 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 131 transitions. [2019-11-15 19:54:23,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-15 19:54:23,239 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:54:23,239 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:54:23,239 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr56ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION]=== [2019-11-15 19:54:23,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:54:23,240 INFO L82 PathProgramCache]: Analyzing trace with hash -1683100078, now seen corresponding path program 1 times [2019-11-15 19:54:23,240 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:54:23,240 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951049736] [2019-11-15 19:54:23,240 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:23,241 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:23,241 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:54:23,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:54:23,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:54:23,345 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-15 19:54:23,346 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951049736] [2019-11-15 19:54:23,346 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:54:23,346 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 19:54:23,346 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887547992] [2019-11-15 19:54:23,347 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 19:54:23,347 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:54:23,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 19:54:23,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 19:54:23,348 INFO L87 Difference]: Start difference. First operand 120 states and 131 transitions. Second operand 7 states. [2019-11-15 19:54:23,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:54:23,963 INFO L93 Difference]: Finished difference Result 199 states and 219 transitions. [2019-11-15 19:54:23,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 19:54:23,963 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2019-11-15 19:54:23,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:54:23,965 INFO L225 Difference]: With dead ends: 199 [2019-11-15 19:54:23,965 INFO L226 Difference]: Without dead ends: 199 [2019-11-15 19:54:23,966 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-11-15 19:54:23,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-11-15 19:54:23,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 115. [2019-11-15 19:54:23,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-11-15 19:54:23,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 126 transitions. [2019-11-15 19:54:23,973 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 126 transitions. Word has length 18 [2019-11-15 19:54:23,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:54:23,973 INFO L462 AbstractCegarLoop]: Abstraction has 115 states and 126 transitions. [2019-11-15 19:54:23,973 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 19:54:23,974 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 126 transitions. [2019-11-15 19:54:23,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-15 19:54:23,975 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:54:23,975 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:54:23,976 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr56ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION]=== [2019-11-15 19:54:23,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:54:23,976 INFO L82 PathProgramCache]: Analyzing trace with hash 405055676, now seen corresponding path program 1 times [2019-11-15 19:54:23,976 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:54:23,977 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938463955] [2019-11-15 19:54:23,977 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:23,977 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:23,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:54:24,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:54:24,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:54:24,104 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-15 19:54:24,105 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938463955] [2019-11-15 19:54:24,105 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:54:24,105 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 19:54:24,105 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764589613] [2019-11-15 19:54:24,106 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 19:54:24,106 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:54:24,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 19:54:24,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-15 19:54:24,106 INFO L87 Difference]: Start difference. First operand 115 states and 126 transitions. Second operand 7 states. [2019-11-15 19:54:24,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:54:24,441 INFO L93 Difference]: Finished difference Result 141 states and 153 transitions. [2019-11-15 19:54:24,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 19:54:24,442 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2019-11-15 19:54:24,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:54:24,443 INFO L225 Difference]: With dead ends: 141 [2019-11-15 19:54:24,443 INFO L226 Difference]: Without dead ends: 141 [2019-11-15 19:54:24,444 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2019-11-15 19:54:24,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-11-15 19:54:24,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 115. [2019-11-15 19:54:24,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-11-15 19:54:24,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 125 transitions. [2019-11-15 19:54:24,449 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 125 transitions. Word has length 24 [2019-11-15 19:54:24,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:54:24,449 INFO L462 AbstractCegarLoop]: Abstraction has 115 states and 125 transitions. [2019-11-15 19:54:24,449 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 19:54:24,449 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 125 transitions. [2019-11-15 19:54:24,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-15 19:54:24,451 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:54:24,451 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-15 19:54:24,451 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr56ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION]=== [2019-11-15 19:54:24,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:54:24,452 INFO L82 PathProgramCache]: Analyzing trace with hash 881818048, now seen corresponding path program 1 times [2019-11-15 19:54:24,452 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:54:24,452 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334223147] [2019-11-15 19:54:24,453 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:24,453 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:24,453 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:54:24,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:54:24,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:54:24,553 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-15 19:54:24,553 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334223147] [2019-11-15 19:54:24,554 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:54:24,554 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 19:54:24,554 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605488716] [2019-11-15 19:54:24,555 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 19:54:24,555 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:54:24,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 19:54:24,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 19:54:24,555 INFO L87 Difference]: Start difference. First operand 115 states and 125 transitions. Second operand 7 states. [2019-11-15 19:54:25,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:54:25,165 INFO L93 Difference]: Finished difference Result 177 states and 195 transitions. [2019-11-15 19:54:25,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 19:54:25,165 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2019-11-15 19:54:25,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:54:25,167 INFO L225 Difference]: With dead ends: 177 [2019-11-15 19:54:25,167 INFO L226 Difference]: Without dead ends: 177 [2019-11-15 19:54:25,168 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-11-15 19:54:25,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-11-15 19:54:25,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 114. [2019-11-15 19:54:25,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-11-15 19:54:25,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 124 transitions. [2019-11-15 19:54:25,172 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 124 transitions. Word has length 26 [2019-11-15 19:54:25,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:54:25,173 INFO L462 AbstractCegarLoop]: Abstraction has 114 states and 124 transitions. [2019-11-15 19:54:25,173 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 19:54:25,173 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 124 transitions. [2019-11-15 19:54:25,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-15 19:54:25,174 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:54:25,174 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-15 19:54:25,175 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr56ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION]=== [2019-11-15 19:54:25,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:54:25,175 INFO L82 PathProgramCache]: Analyzing trace with hash 881818049, now seen corresponding path program 1 times [2019-11-15 19:54:25,175 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:54:25,175 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69728973] [2019-11-15 19:54:25,176 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:25,176 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:25,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:54:25,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:54:25,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:54:25,291 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-15 19:54:25,291 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69728973] [2019-11-15 19:54:25,291 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:54:25,292 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 19:54:25,292 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922136736] [2019-11-15 19:54:25,292 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 19:54:25,292 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:54:25,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 19:54:25,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 19:54:25,293 INFO L87 Difference]: Start difference. First operand 114 states and 124 transitions. Second operand 7 states. [2019-11-15 19:54:25,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:54:25,938 INFO L93 Difference]: Finished difference Result 201 states and 220 transitions. [2019-11-15 19:54:25,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 19:54:25,939 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2019-11-15 19:54:25,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:54:25,941 INFO L225 Difference]: With dead ends: 201 [2019-11-15 19:54:25,941 INFO L226 Difference]: Without dead ends: 201 [2019-11-15 19:54:25,942 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-11-15 19:54:25,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-11-15 19:54:25,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 106. [2019-11-15 19:54:25,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-11-15 19:54:25,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 115 transitions. [2019-11-15 19:54:25,946 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 115 transitions. Word has length 26 [2019-11-15 19:54:25,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:54:25,947 INFO L462 AbstractCegarLoop]: Abstraction has 106 states and 115 transitions. [2019-11-15 19:54:25,947 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 19:54:25,947 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 115 transitions. [2019-11-15 19:54:25,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-15 19:54:25,948 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:54:25,948 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] [2019-11-15 19:54:25,950 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr56ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION]=== [2019-11-15 19:54:25,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:54:25,950 INFO L82 PathProgramCache]: Analyzing trace with hash -1815582269, now seen corresponding path program 1 times [2019-11-15 19:54:25,950 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:54:25,951 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276052285] [2019-11-15 19:54:25,951 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:25,951 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:25,951 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:54:25,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:54:26,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:54:26,107 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-15 19:54:26,107 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276052285] [2019-11-15 19:54:26,107 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1781475669] [2019-11-15 19:54:26,107 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_37a8eefb-eaae-47ec-a330-6064ca78fc56/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-15 19:54:26,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:54:26,267 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-15 19:54:26,275 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:54:26,346 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-15 19:54:26,347 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:54:26,359 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:54:26,364 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-15 19:54:26,365 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:54:26,375 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:54:26,376 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:54:26,376 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:15 [2019-11-15 19:54:26,390 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:54:26,393 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 27 treesize of output 11 [2019-11-15 19:54:26,394 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:54:26,407 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:54:26,414 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:54:26,415 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 27 treesize of output 11 [2019-11-15 19:54:26,416 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:54:26,422 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:54:26,423 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:54:26,423 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:53, output treesize:15 [2019-11-15 19:54:26,440 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-15 19:54:26,440 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:54:26,451 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:54:26,459 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-15 19:54:26,459 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:54:26,465 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:54:26,466 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-15 19:54:26,466 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:7 [2019-11-15 19:54:26,471 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-15 19:54:26,472 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 19:54:26,472 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 7 [2019-11-15 19:54:26,474 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559756416] [2019-11-15 19:54:26,475 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 19:54:26,475 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:54:26,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 19:54:26,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 19:54:26,476 INFO L87 Difference]: Start difference. First operand 106 states and 115 transitions. Second operand 7 states. [2019-11-15 19:54:27,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:54:27,079 INFO L93 Difference]: Finished difference Result 169 states and 181 transitions. [2019-11-15 19:54:27,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 19:54:27,079 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2019-11-15 19:54:27,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:54:27,081 INFO L225 Difference]: With dead ends: 169 [2019-11-15 19:54:27,081 INFO L226 Difference]: Without dead ends: 169 [2019-11-15 19:54:27,081 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-11-15 19:54:27,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-11-15 19:54:27,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 120. [2019-11-15 19:54:27,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-11-15 19:54:27,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 131 transitions. [2019-11-15 19:54:27,087 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 131 transitions. Word has length 27 [2019-11-15 19:54:27,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:54:27,087 INFO L462 AbstractCegarLoop]: Abstraction has 120 states and 131 transitions. [2019-11-15 19:54:27,087 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 19:54:27,087 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 131 transitions. [2019-11-15 19:54:27,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-15 19:54:27,088 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:54:27,089 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:54:27,289 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 19:54:27,290 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr56ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION]=== [2019-11-15 19:54:27,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:54:27,290 INFO L82 PathProgramCache]: Analyzing trace with hash -1632709297, now seen corresponding path program 1 times [2019-11-15 19:54:27,290 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:54:27,291 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796149786] [2019-11-15 19:54:27,291 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:27,291 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:27,291 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:54:27,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:54:27,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:54:27,453 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-15 19:54:27,453 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796149786] [2019-11-15 19:54:27,454 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:54:27,454 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 19:54:27,454 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546303620] [2019-11-15 19:54:27,454 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 19:54:27,454 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:54:27,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 19:54:27,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 19:54:27,455 INFO L87 Difference]: Start difference. First operand 120 states and 131 transitions. Second operand 6 states. [2019-11-15 19:54:27,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:54:27,748 INFO L93 Difference]: Finished difference Result 123 states and 132 transitions. [2019-11-15 19:54:27,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 19:54:27,749 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-11-15 19:54:27,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:54:27,750 INFO L225 Difference]: With dead ends: 123 [2019-11-15 19:54:27,750 INFO L226 Difference]: Without dead ends: 123 [2019-11-15 19:54:27,751 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-15 19:54:27,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-11-15 19:54:27,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 119. [2019-11-15 19:54:27,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-11-15 19:54:27,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 128 transitions. [2019-11-15 19:54:27,756 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 128 transitions. Word has length 28 [2019-11-15 19:54:27,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:54:27,756 INFO L462 AbstractCegarLoop]: Abstraction has 119 states and 128 transitions. [2019-11-15 19:54:27,756 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 19:54:27,756 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 128 transitions. [2019-11-15 19:54:27,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-15 19:54:27,757 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:54:27,757 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] [2019-11-15 19:54:27,758 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr56ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION]=== [2019-11-15 19:54:27,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:54:27,758 INFO L82 PathProgramCache]: Analyzing trace with hash -1017836257, now seen corresponding path program 1 times [2019-11-15 19:54:27,759 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:54:27,759 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384571302] [2019-11-15 19:54:27,759 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:27,759 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:27,759 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:54:27,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:54:27,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:54:27,850 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-15 19:54:27,851 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384571302] [2019-11-15 19:54:27,851 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [764122399] [2019-11-15 19:54:27,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_37a8eefb-eaae-47ec-a330-6064ca78fc56/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-15 19:54:27,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:54:27,995 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 19:54:28,002 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:54:28,031 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-15 19:54:28,032 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 19:54:28,032 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [8] total 9 [2019-11-15 19:54:28,032 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230464790] [2019-11-15 19:54:28,033 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 19:54:28,033 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:54:28,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 19:54:28,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-11-15 19:54:28,033 INFO L87 Difference]: Start difference. First operand 119 states and 128 transitions. Second operand 3 states. [2019-11-15 19:54:28,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:54:28,085 INFO L93 Difference]: Finished difference Result 118 states and 126 transitions. [2019-11-15 19:54:28,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 19:54:28,085 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-11-15 19:54:28,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:54:28,087 INFO L225 Difference]: With dead ends: 118 [2019-11-15 19:54:28,087 INFO L226 Difference]: Without dead ends: 118 [2019-11-15 19:54:28,087 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-11-15 19:54:28,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-11-15 19:54:28,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2019-11-15 19:54:28,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-11-15 19:54:28,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 126 transitions. [2019-11-15 19:54:28,092 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 126 transitions. Word has length 29 [2019-11-15 19:54:28,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:54:28,092 INFO L462 AbstractCegarLoop]: Abstraction has 118 states and 126 transitions. [2019-11-15 19:54:28,094 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 19:54:28,094 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 126 transitions. [2019-11-15 19:54:28,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-15 19:54:28,098 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:54:28,098 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-15 19:54:28,300 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 19:54:28,300 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr56ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION]=== [2019-11-15 19:54:28,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:54:28,300 INFO L82 PathProgramCache]: Analyzing trace with hash 1111908482, now seen corresponding path program 1 times [2019-11-15 19:54:28,301 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:54:28,301 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856981563] [2019-11-15 19:54:28,301 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:28,301 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:28,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:54:28,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:54:28,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:54:28,394 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-15 19:54:28,394 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856981563] [2019-11-15 19:54:28,395 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [865114620] [2019-11-15 19:54:28,395 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_37a8eefb-eaae-47ec-a330-6064ca78fc56/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-15 19:54:28,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:54:28,540 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 19:54:28,545 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:54:28,577 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:54:28,577 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-15 19:54:28,578 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:54:28,581 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:54:28,581 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:54:28,581 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2019-11-15 19:54:28,585 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-15 19:54:28,585 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 19:54:28,586 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 9 [2019-11-15 19:54:28,586 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816371171] [2019-11-15 19:54:28,586 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 19:54:28,586 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:54:28,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 19:54:28,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-11-15 19:54:28,587 INFO L87 Difference]: Start difference. First operand 118 states and 126 transitions. Second operand 4 states. [2019-11-15 19:54:28,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:54:28,762 INFO L93 Difference]: Finished difference Result 154 states and 163 transitions. [2019-11-15 19:54:28,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 19:54:28,763 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2019-11-15 19:54:28,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:54:28,765 INFO L225 Difference]: With dead ends: 154 [2019-11-15 19:54:28,765 INFO L226 Difference]: Without dead ends: 154 [2019-11-15 19:54:28,765 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-11-15 19:54:28,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-11-15 19:54:28,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 121. [2019-11-15 19:54:28,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-11-15 19:54:28,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 130 transitions. [2019-11-15 19:54:28,770 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 130 transitions. Word has length 31 [2019-11-15 19:54:28,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:54:28,770 INFO L462 AbstractCegarLoop]: Abstraction has 121 states and 130 transitions. [2019-11-15 19:54:28,770 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 19:54:28,771 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 130 transitions. [2019-11-15 19:54:28,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-15 19:54:28,771 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:54:28,772 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] [2019-11-15 19:54:28,977 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 19:54:28,978 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr56ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION]=== [2019-11-15 19:54:28,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:54:28,978 INFO L82 PathProgramCache]: Analyzing trace with hash -397046487, now seen corresponding path program 1 times [2019-11-15 19:54:28,978 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:54:28,979 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491540084] [2019-11-15 19:54:28,979 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:28,979 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:28,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:54:28,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:54:29,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:54:29,103 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-15 19:54:29,103 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491540084] [2019-11-15 19:54:29,103 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1048507921] [2019-11-15 19:54:29,104 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_37a8eefb-eaae-47ec-a330-6064ca78fc56/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-15 19:54:29,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:54:29,250 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 19:54:29,261 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:54:29,291 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-15 19:54:29,295 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 19:54:29,295 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [9] total 10 [2019-11-15 19:54:29,296 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471226808] [2019-11-15 19:54:29,296 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 19:54:29,296 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:54:29,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 19:54:29,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-11-15 19:54:29,297 INFO L87 Difference]: Start difference. First operand 121 states and 130 transitions. Second operand 3 states. [2019-11-15 19:54:29,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:54:29,356 INFO L93 Difference]: Finished difference Result 122 states and 130 transitions. [2019-11-15 19:54:29,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 19:54:29,357 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-11-15 19:54:29,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:54:29,358 INFO L225 Difference]: With dead ends: 122 [2019-11-15 19:54:29,358 INFO L226 Difference]: Without dead ends: 122 [2019-11-15 19:54:29,358 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-11-15 19:54:29,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-11-15 19:54:29,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2019-11-15 19:54:29,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-11-15 19:54:29,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 130 transitions. [2019-11-15 19:54:29,363 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 130 transitions. Word has length 33 [2019-11-15 19:54:29,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:54:29,363 INFO L462 AbstractCegarLoop]: Abstraction has 122 states and 130 transitions. [2019-11-15 19:54:29,363 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 19:54:29,363 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 130 transitions. [2019-11-15 19:54:29,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-15 19:54:29,365 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:54:29,365 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-15 19:54:29,569 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 19:54:29,569 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr56ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION]=== [2019-11-15 19:54:29,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:54:29,570 INFO L82 PathProgramCache]: Analyzing trace with hash 690422284, now seen corresponding path program 1 times [2019-11-15 19:54:29,570 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:54:29,570 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650615535] [2019-11-15 19:54:29,570 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:29,570 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:29,571 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:54:29,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:54:29,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:54:29,686 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-15 19:54:29,686 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650615535] [2019-11-15 19:54:29,686 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [737072127] [2019-11-15 19:54:29,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_37a8eefb-eaae-47ec-a330-6064ca78fc56/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-15 19:54:29,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:54:29,850 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-15 19:54:29,853 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:54:29,868 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-15 19:54:29,868 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:54:29,871 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:54:29,871 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:54:29,872 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-11-15 19:54:29,886 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-15 19:54:29,886 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:54:29,894 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:54:29,894 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-15 19:54:29,894 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-11-15 19:54:29,916 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-15 19:54:29,916 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 19:54:29,916 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 10 [2019-11-15 19:54:29,916 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242043492] [2019-11-15 19:54:29,917 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 19:54:29,917 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:54:29,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 19:54:29,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-15 19:54:29,918 INFO L87 Difference]: Start difference. First operand 122 states and 130 transitions. Second operand 4 states. [2019-11-15 19:54:30,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:54:30,052 INFO L93 Difference]: Finished difference Result 131 states and 139 transitions. [2019-11-15 19:54:30,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 19:54:30,053 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-11-15 19:54:30,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:54:30,054 INFO L225 Difference]: With dead ends: 131 [2019-11-15 19:54:30,054 INFO L226 Difference]: Without dead ends: 131 [2019-11-15 19:54:30,055 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-11-15 19:54:30,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-11-15 19:54:30,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 125. [2019-11-15 19:54:30,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-11-15 19:54:30,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 133 transitions. [2019-11-15 19:54:30,059 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 133 transitions. Word has length 35 [2019-11-15 19:54:30,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:54:30,059 INFO L462 AbstractCegarLoop]: Abstraction has 125 states and 133 transitions. [2019-11-15 19:54:30,060 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 19:54:30,060 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 133 transitions. [2019-11-15 19:54:30,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-15 19:54:30,062 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:54:30,063 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] [2019-11-15 19:54:30,267 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 19:54:30,267 INFO L410 AbstractCegarLoop]: === Iteration 18 === [mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr56ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION]=== [2019-11-15 19:54:30,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:54:30,268 INFO L82 PathProgramCache]: Analyzing trace with hash -1683544525, now seen corresponding path program 1 times [2019-11-15 19:54:30,268 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:54:30,268 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337783568] [2019-11-15 19:54:30,268 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:30,268 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:30,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:54:30,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:54:30,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:54:30,534 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-15 19:54:30,534 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337783568] [2019-11-15 19:54:30,535 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1260060697] [2019-11-15 19:54:30,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_37a8eefb-eaae-47ec-a330-6064ca78fc56/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-15 19:54:30,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:54:30,685 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 28 conjunts are in the unsatisfiable core [2019-11-15 19:54:30,687 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:54:30,696 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-15 19:54:30,696 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:54:30,703 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:54:30,703 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:54:30,703 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-11-15 19:54:30,729 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_34|], 2=[|v_#memory_$Pointer$.base_35|]} [2019-11-15 19:54:30,749 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-15 19:54:30,749 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:54:30,763 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:54:30,769 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:54:30,770 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 27 treesize of output 11 [2019-11-15 19:54:30,770 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:54:30,777 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:54:30,777 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:54:30,778 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:49, output treesize:11 [2019-11-15 19:54:30,920 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-15 19:54:30,921 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:54:30,931 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:54:30,938 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-15 19:54:30,939 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:54:30,951 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:54:30,951 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-15 19:54:30,952 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:10 [2019-11-15 19:54:31,036 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-15 19:54:31,037 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 19:54:31,038 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 17 [2019-11-15 19:54:31,039 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071525917] [2019-11-15 19:54:31,042 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-15 19:54:31,042 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:54:31,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-15 19:54:31,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2019-11-15 19:54:31,043 INFO L87 Difference]: Start difference. First operand 125 states and 133 transitions. Second operand 17 states. [2019-11-15 19:54:32,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:54:32,145 INFO L93 Difference]: Finished difference Result 181 states and 192 transitions. [2019-11-15 19:54:32,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-15 19:54:32,146 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 36 [2019-11-15 19:54:32,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:54:32,147 INFO L225 Difference]: With dead ends: 181 [2019-11-15 19:54:32,147 INFO L226 Difference]: Without dead ends: 181 [2019-11-15 19:54:32,148 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=107, Invalid=543, Unknown=0, NotChecked=0, Total=650 [2019-11-15 19:54:32,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-11-15 19:54:32,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 136. [2019-11-15 19:54:32,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-11-15 19:54:32,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 146 transitions. [2019-11-15 19:54:32,153 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 146 transitions. Word has length 36 [2019-11-15 19:54:32,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:54:32,154 INFO L462 AbstractCegarLoop]: Abstraction has 136 states and 146 transitions. [2019-11-15 19:54:32,154 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-15 19:54:32,154 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 146 transitions. [2019-11-15 19:54:32,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-15 19:54:32,155 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:54:32,155 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] [2019-11-15 19:54:32,359 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 19:54:32,365 INFO L410 AbstractCegarLoop]: === Iteration 19 === [mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr56ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION]=== [2019-11-15 19:54:32,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:54:32,365 INFO L82 PathProgramCache]: Analyzing trace with hash 2057728756, now seen corresponding path program 1 times [2019-11-15 19:54:32,366 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:54:32,366 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97878411] [2019-11-15 19:54:32,366 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:32,366 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:32,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:54:32,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:54:32,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:54:32,652 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-15 19:54:32,652 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97878411] [2019-11-15 19:54:32,653 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1679930314] [2019-11-15 19:54:32,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_37a8eefb-eaae-47ec-a330-6064ca78fc56/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-15 19:54:32,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:54:32,826 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 39 conjunts are in the unsatisfiable core [2019-11-15 19:54:32,839 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:54:32,939 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_55|], 1=[|v_#valid_74|]} [2019-11-15 19:54:32,943 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-15 19:54:32,943 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:54:32,958 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:54:32,967 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:54:32,967 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-15 19:54:32,968 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:54:32,978 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:54:32,978 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:54:32,978 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2019-11-15 19:54:33,026 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-15 19:54:33,027 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:54:33,040 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:54:33,044 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-15 19:54:33,044 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:54:33,056 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:54:33,057 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-15 19:54:33,057 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:41, output treesize:34 [2019-11-15 19:54:33,199 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:54:33,199 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 1 case distinctions, treesize of input 36 treesize of output 51 [2019-11-15 19:54:33,201 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:54:33,258 INFO L567 ElimStorePlain]: treesize reduction 24, result has 63.6 percent of original size [2019-11-15 19:54:33,264 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 19 treesize of output 18 [2019-11-15 19:54:33,265 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:54:33,281 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:54:33,282 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-15 19:54:33,282 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:54, output treesize:31 [2019-11-15 19:54:33,338 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_38|], 6=[|v_#memory_$Pointer$.offset_37|]} [2019-11-15 19:54:33,373 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:54:33,374 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 91 treesize of output 95 [2019-11-15 19:54:33,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:54:33,378 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:54:33,410 INFO L567 ElimStorePlain]: treesize reduction 32, result has 67.7 percent of original size [2019-11-15 19:54:33,423 INFO L341 Elim1Store]: treesize reduction 35, result has 23.9 percent of original size [2019-11-15 19:54:33,424 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 50 treesize of output 25 [2019-11-15 19:54:33,425 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:54:33,437 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:54:33,438 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-15 19:54:33,438 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:98, output treesize:36 [2019-11-15 19:54:33,590 INFO L392 ElimStorePlain]: Different costs {0=[|#memory_$Pointer$.base|], 2=[|#memory_$Pointer$.offset|]} [2019-11-15 19:54:33,593 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 36 treesize of output 20 [2019-11-15 19:54:33,594 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:54:33,609 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:54:33,612 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 22 treesize of output 10 [2019-11-15 19:54:33,613 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:54:33,625 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:54:33,625 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:54:33,626 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:50, output treesize:9 [2019-11-15 19:54:33,637 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-15 19:54:33,638 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 19:54:33,638 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 22 [2019-11-15 19:54:33,638 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165288105] [2019-11-15 19:54:33,639 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-15 19:54:33,639 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:54:33,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-15 19:54:33,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=435, Unknown=0, NotChecked=0, Total=506 [2019-11-15 19:54:33,640 INFO L87 Difference]: Start difference. First operand 136 states and 146 transitions. Second operand 23 states. [2019-11-15 19:54:35,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:54:35,444 INFO L93 Difference]: Finished difference Result 219 states and 237 transitions. [2019-11-15 19:54:35,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-15 19:54:35,444 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 36 [2019-11-15 19:54:35,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:54:35,445 INFO L225 Difference]: With dead ends: 219 [2019-11-15 19:54:35,446 INFO L226 Difference]: Without dead ends: 219 [2019-11-15 19:54:35,446 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=227, Invalid=1033, Unknown=0, NotChecked=0, Total=1260 [2019-11-15 19:54:35,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2019-11-15 19:54:35,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 161. [2019-11-15 19:54:35,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-11-15 19:54:35,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 176 transitions. [2019-11-15 19:54:35,452 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 176 transitions. Word has length 36 [2019-11-15 19:54:35,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:54:35,452 INFO L462 AbstractCegarLoop]: Abstraction has 161 states and 176 transitions. [2019-11-15 19:54:35,452 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-15 19:54:35,452 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 176 transitions. [2019-11-15 19:54:35,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-15 19:54:35,453 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:54:35,453 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] [2019-11-15 19:54:35,657 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 19:54:35,658 INFO L410 AbstractCegarLoop]: === Iteration 20 === [mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr56ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION]=== [2019-11-15 19:54:35,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:54:35,658 INFO L82 PathProgramCache]: Analyzing trace with hash 2057728755, now seen corresponding path program 1 times [2019-11-15 19:54:35,658 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:54:35,659 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820221016] [2019-11-15 19:54:35,659 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:35,659 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:35,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:54:35,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:54:35,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:54:35,855 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-15 19:54:35,855 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820221016] [2019-11-15 19:54:35,855 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1778252061] [2019-11-15 19:54:35,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_37a8eefb-eaae-47ec-a330-6064ca78fc56/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-15 19:54:35,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:54:35,998 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 25 conjunts are in the unsatisfiable core [2019-11-15 19:54:36,002 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:54:36,031 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:54:36,032 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-15 19:54:36,032 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:54:36,053 INFO L567 ElimStorePlain]: treesize reduction 14, result has 60.0 percent of original size [2019-11-15 19:54:36,054 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:54:36,054 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2019-11-15 19:54:36,089 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-15 19:54:36,090 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:54:36,108 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:54:36,108 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:54:36,109 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:29 [2019-11-15 19:54:36,221 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:54:36,221 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 1 case distinctions, treesize of input 36 treesize of output 51 [2019-11-15 19:54:36,222 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:54:36,244 INFO L567 ElimStorePlain]: treesize reduction 24, result has 54.7 percent of original size [2019-11-15 19:54:36,245 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:54:36,245 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:41, output treesize:22 [2019-11-15 19:54:36,302 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:54:36,302 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 49 treesize of output 69 [2019-11-15 19:54:36,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:54:36,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:54:36,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:54:36,305 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-11-15 19:54:36,327 INFO L567 ElimStorePlain]: treesize reduction 60, result has 28.6 percent of original size [2019-11-15 19:54:36,328 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:54:36,328 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:54, output treesize:23 [2019-11-15 19:54:36,379 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 25 treesize of output 13 [2019-11-15 19:54:36,380 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:54:36,387 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:54:36,388 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 19:54:36,389 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:15 [2019-11-15 19:54:36,463 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-15 19:54:36,463 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 19:54:36,463 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 21 [2019-11-15 19:54:36,463 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992702409] [2019-11-15 19:54:36,464 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-15 19:54:36,464 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:54:36,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-15 19:54:36,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=384, Unknown=0, NotChecked=0, Total=462 [2019-11-15 19:54:36,465 INFO L87 Difference]: Start difference. First operand 161 states and 176 transitions. Second operand 22 states. [2019-11-15 19:54:37,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:54:37,501 INFO L93 Difference]: Finished difference Result 235 states and 255 transitions. [2019-11-15 19:54:37,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-15 19:54:37,502 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 36 [2019-11-15 19:54:37,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:54:37,504 INFO L225 Difference]: With dead ends: 235 [2019-11-15 19:54:37,504 INFO L226 Difference]: Without dead ends: 235 [2019-11-15 19:54:37,504 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=184, Invalid=686, Unknown=0, NotChecked=0, Total=870 [2019-11-15 19:54:37,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2019-11-15 19:54:37,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 161. [2019-11-15 19:54:37,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-11-15 19:54:37,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 175 transitions. [2019-11-15 19:54:37,523 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 175 transitions. Word has length 36 [2019-11-15 19:54:37,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:54:37,524 INFO L462 AbstractCegarLoop]: Abstraction has 161 states and 175 transitions. [2019-11-15 19:54:37,525 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-15 19:54:37,525 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 175 transitions. [2019-11-15 19:54:37,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-15 19:54:37,526 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:54:37,526 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-15 19:54:37,730 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 19:54:37,731 INFO L410 AbstractCegarLoop]: === Iteration 21 === [mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr56ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION]=== [2019-11-15 19:54:37,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:54:37,732 INFO L82 PathProgramCache]: Analyzing trace with hash -2142209156, now seen corresponding path program 1 times [2019-11-15 19:54:37,732 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:54:37,732 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317906089] [2019-11-15 19:54:37,732 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:37,732 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:37,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:54:37,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:54:38,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:54:38,049 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 19:54:38,049 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317906089] [2019-11-15 19:54:38,049 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1402826936] [2019-11-15 19:54:38,050 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_37a8eefb-eaae-47ec-a330-6064ca78fc56/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 19:54:38,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:54:38,204 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-15 19:54:38,210 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:54:38,532 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-15 19:54:38,532 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 19:54:38,532 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2019-11-15 19:54:38,533 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860820864] [2019-11-15 19:54:38,533 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-15 19:54:38,533 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:54:38,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-15 19:54:38,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2019-11-15 19:54:38,534 INFO L87 Difference]: Start difference. First operand 161 states and 175 transitions. Second operand 17 states. [2019-11-15 19:54:39,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:54:39,313 INFO L93 Difference]: Finished difference Result 171 states and 184 transitions. [2019-11-15 19:54:39,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-15 19:54:39,313 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 39 [2019-11-15 19:54:39,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:54:39,314 INFO L225 Difference]: With dead ends: 171 [2019-11-15 19:54:39,315 INFO L226 Difference]: Without dead ends: 146 [2019-11-15 19:54:39,315 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=104, Invalid=448, Unknown=0, NotChecked=0, Total=552 [2019-11-15 19:54:39,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-11-15 19:54:39,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2019-11-15 19:54:39,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-15 19:54:39,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 159 transitions. [2019-11-15 19:54:39,320 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 159 transitions. Word has length 39 [2019-11-15 19:54:39,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:54:39,320 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 159 transitions. [2019-11-15 19:54:39,321 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-15 19:54:39,321 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 159 transitions. [2019-11-15 19:54:39,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-15 19:54:39,322 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:54:39,322 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 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] [2019-11-15 19:54:39,526 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 19:54:39,528 INFO L410 AbstractCegarLoop]: === Iteration 22 === [mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr56ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION]=== [2019-11-15 19:54:39,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:54:39,528 INFO L82 PathProgramCache]: Analyzing trace with hash 1800901615, now seen corresponding path program 2 times [2019-11-15 19:54:39,528 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:54:39,529 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519238335] [2019-11-15 19:54:39,529 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:39,529 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:39,529 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:54:39,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:54:39,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:54:39,945 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 19:54:39,945 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519238335] [2019-11-15 19:54:39,946 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [559614323] [2019-11-15 19:54:39,946 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_37a8eefb-eaae-47ec-a330-6064ca78fc56/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 19:54:40,134 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 19:54:40,134 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 19:54:40,137 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 56 conjunts are in the unsatisfiable core [2019-11-15 19:54:40,140 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:54:40,333 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:54:40,334 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-15 19:54:40,334 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:54:40,351 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:54:40,351 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:54:40,351 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:20 [2019-11-15 19:54:40,394 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-15 19:54:40,394 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:54:40,408 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:54:40,411 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-15 19:54:40,411 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:54:40,424 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:54:40,424 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-15 19:54:40,424 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:28 [2019-11-15 19:54:40,607 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:54:40,608 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 26 treesize of output 21 [2019-11-15 19:54:40,608 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:54:40,659 INFO L567 ElimStorePlain]: treesize reduction 3, result has 94.3 percent of original size [2019-11-15 19:54:40,675 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:54:40,675 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 1 case distinctions, treesize of input 27 treesize of output 38 [2019-11-15 19:54:40,676 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:54:40,708 INFO L567 ElimStorePlain]: treesize reduction 16, result has 72.4 percent of original size [2019-11-15 19:54:40,708 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:54:40,709 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:42 [2019-11-15 19:54:40,791 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 46 treesize of output 25 [2019-11-15 19:54:40,791 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:54:40,809 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:54:40,817 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:54:40,817 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 51 [2019-11-15 19:54:40,818 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:54:40,843 INFO L567 ElimStorePlain]: treesize reduction 24, result has 64.7 percent of original size [2019-11-15 19:54:40,843 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:54:40,843 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:98, output treesize:44 [2019-11-15 19:54:41,067 INFO L341 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2019-11-15 19:54:41,067 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 43 [2019-11-15 19:54:41,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:54:41,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:54:41,070 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-15 19:54:41,097 INFO L567 ElimStorePlain]: treesize reduction 8, result has 81.8 percent of original size [2019-11-15 19:54:41,115 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:54:41,115 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 21 [2019-11-15 19:54:41,116 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:54:41,124 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:54:41,124 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-15 19:54:41,124 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:71, output treesize:10 [2019-11-15 19:54:41,226 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 19:54:41,226 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 19:54:41,226 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 31 [2019-11-15 19:54:41,227 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374712185] [2019-11-15 19:54:41,227 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-11-15 19:54:41,227 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:54:41,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-11-15 19:54:41,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=824, Unknown=0, NotChecked=0, Total=930 [2019-11-15 19:54:41,228 INFO L87 Difference]: Start difference. First operand 146 states and 159 transitions. Second operand 31 states. [2019-11-15 19:54:43,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:54:43,016 INFO L93 Difference]: Finished difference Result 202 states and 219 transitions. [2019-11-15 19:54:43,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-15 19:54:43,018 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 41 [2019-11-15 19:54:43,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:54:43,020 INFO L225 Difference]: With dead ends: 202 [2019-11-15 19:54:43,020 INFO L226 Difference]: Without dead ends: 202 [2019-11-15 19:54:43,021 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 436 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=304, Invalid=1766, Unknown=0, NotChecked=0, Total=2070 [2019-11-15 19:54:43,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2019-11-15 19:54:43,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 148. [2019-11-15 19:54:43,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-11-15 19:54:43,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 161 transitions. [2019-11-15 19:54:43,025 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 161 transitions. Word has length 41 [2019-11-15 19:54:43,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:54:43,026 INFO L462 AbstractCegarLoop]: Abstraction has 148 states and 161 transitions. [2019-11-15 19:54:43,026 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-11-15 19:54:43,026 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 161 transitions. [2019-11-15 19:54:43,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-15 19:54:43,027 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:54:43,027 INFO L380 BasicCegarLoop]: trace histogram [2, 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] [2019-11-15 19:54:43,231 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 19:54:43,232 INFO L410 AbstractCegarLoop]: === Iteration 23 === [mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr56ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION]=== [2019-11-15 19:54:43,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:54:43,232 INFO L82 PathProgramCache]: Analyzing trace with hash -1190858589, now seen corresponding path program 1 times [2019-11-15 19:54:43,232 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:54:43,232 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903041639] [2019-11-15 19:54:43,232 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:43,233 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:43,233 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:54:43,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:54:43,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:54:43,675 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 19:54:43,675 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903041639] [2019-11-15 19:54:43,676 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1455974725] [2019-11-15 19:54:43,676 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_37a8eefb-eaae-47ec-a330-6064ca78fc56/bin/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 19:54:43,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:54:43,860 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 50 conjunts are in the unsatisfiable core [2019-11-15 19:54:43,862 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:54:43,950 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:54:43,950 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-15 19:54:43,951 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:54:43,959 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:54:43,959 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:54:43,959 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2019-11-15 19:54:43,993 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-15 19:54:43,993 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:54:44,004 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:54:44,008 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-15 19:54:44,008 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:54:44,019 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:54:44,019 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-15 19:54:44,019 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:25 [2019-11-15 19:54:44,151 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:54:44,152 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 1 case distinctions, treesize of input 27 treesize of output 46 [2019-11-15 19:54:44,152 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:54:44,197 INFO L567 ElimStorePlain]: treesize reduction 27, result has 63.5 percent of original size [2019-11-15 19:54:44,200 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 26 treesize of output 21 [2019-11-15 19:54:44,201 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:54:44,214 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:54:44,214 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:54:44,214 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:58, output treesize:39 [2019-11-15 19:54:44,283 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:54:44,283 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 85 treesize of output 98 [2019-11-15 19:54:44,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:54:44,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:54:44,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:54:44,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:54:44,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:54:44,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:54:44,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:54:44,290 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 5 xjuncts. [2019-11-15 19:54:44,377 INFO L567 ElimStorePlain]: treesize reduction 332, result has 17.2 percent of original size [2019-11-15 19:54:44,382 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 65 treesize of output 44 [2019-11-15 19:54:44,383 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:54:44,392 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:54:44,393 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:54:44,393 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:95, output treesize:41 [2019-11-15 19:54:44,588 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:54:44,588 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 63 [2019-11-15 19:54:44,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:54:44,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:54:44,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:54:44,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:54:44,593 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-15 19:54:44,633 INFO L567 ElimStorePlain]: treesize reduction 28, result has 56.3 percent of original size [2019-11-15 19:54:44,647 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:54:44,647 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 21 [2019-11-15 19:54:44,648 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:54:44,657 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:54:44,657 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-15 19:54:44,658 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:71, output treesize:10 [2019-11-15 19:54:44,735 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 19:54:44,736 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 19:54:44,736 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 30 [2019-11-15 19:54:44,736 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301066838] [2019-11-15 19:54:44,737 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-11-15 19:54:44,737 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:54:44,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-11-15 19:54:44,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=775, Unknown=0, NotChecked=0, Total=870 [2019-11-15 19:54:44,738 INFO L87 Difference]: Start difference. First operand 148 states and 161 transitions. Second operand 30 states. [2019-11-15 19:54:46,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:54:46,480 INFO L93 Difference]: Finished difference Result 185 states and 199 transitions. [2019-11-15 19:54:46,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-15 19:54:46,480 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 42 [2019-11-15 19:54:46,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:54:46,481 INFO L225 Difference]: With dead ends: 185 [2019-11-15 19:54:46,482 INFO L226 Difference]: Without dead ends: 182 [2019-11-15 19:54:46,482 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 390 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=259, Invalid=1633, Unknown=0, NotChecked=0, Total=1892 [2019-11-15 19:54:46,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-11-15 19:54:46,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 147. [2019-11-15 19:54:46,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-11-15 19:54:46,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 159 transitions. [2019-11-15 19:54:46,487 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 159 transitions. Word has length 42 [2019-11-15 19:54:46,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:54:46,487 INFO L462 AbstractCegarLoop]: Abstraction has 147 states and 159 transitions. [2019-11-15 19:54:46,487 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-11-15 19:54:46,488 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 159 transitions. [2019-11-15 19:54:46,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-15 19:54:46,488 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:54:46,489 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] [2019-11-15 19:54:46,692 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 19:54:46,693 INFO L410 AbstractCegarLoop]: === Iteration 24 === [mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr56ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION]=== [2019-11-15 19:54:46,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:54:46,695 INFO L82 PathProgramCache]: Analyzing trace with hash 1300671821, now seen corresponding path program 1 times [2019-11-15 19:54:46,695 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:54:46,695 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529378394] [2019-11-15 19:54:46,695 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:46,696 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:46,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:54:46,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:54:47,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:54:47,162 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-15 19:54:47,163 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529378394] [2019-11-15 19:54:47,163 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1030178550] [2019-11-15 19:54:47,163 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_37a8eefb-eaae-47ec-a330-6064ca78fc56/bin/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 19:54:47,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:54:47,338 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 56 conjunts are in the unsatisfiable core [2019-11-15 19:54:47,341 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:54:47,462 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:54:47,462 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-15 19:54:47,462 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:54:47,490 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.9 percent of original size [2019-11-15 19:54:47,491 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:54:47,491 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2019-11-15 19:54:47,533 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-15 19:54:47,534 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:54:47,553 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:54:47,557 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-15 19:54:47,557 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:54:47,570 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:54:47,571 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-15 19:54:47,571 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:46, output treesize:39 [2019-11-15 19:54:47,717 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:54:47,718 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 1 case distinctions, treesize of input 36 treesize of output 51 [2019-11-15 19:54:47,718 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:54:47,760 INFO L567 ElimStorePlain]: treesize reduction 24, result has 68.8 percent of original size [2019-11-15 19:54:47,765 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 19 treesize of output 18 [2019-11-15 19:54:47,765 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:54:47,781 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:54:47,781 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:54:47,782 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:65, output treesize:49 [2019-11-15 19:54:47,843 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:54:47,846 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 34 treesize of output 21 [2019-11-15 19:54:47,847 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:54:47,873 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:54:47,877 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:54:47,878 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 34 treesize of output 21 [2019-11-15 19:54:47,878 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:54:47,898 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:54:47,899 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:54:47,899 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:94, output treesize:56 [2019-11-15 19:54:47,961 INFO L392 ElimStorePlain]: Different costs {1=[|v_#length_56|], 3=[|v_#valid_83|]} [2019-11-15 19:54:47,966 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:54:47,967 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2019-11-15 19:54:47,967 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:54:47,992 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:54:48,007 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:54:48,007 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2019-11-15 19:54:48,008 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:54:48,029 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:54:48,030 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:54:48,030 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:67, output treesize:59 [2019-11-15 19:54:48,094 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 26 treesize of output 21 [2019-11-15 19:54:48,095 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:54:48,121 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:54:48,126 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 26 treesize of output 21 [2019-11-15 19:54:48,127 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:54:48,149 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:54:48,149 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-15 19:54:48,149 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:81, output treesize:57 [2019-11-15 19:54:48,349 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_48|], 6=[|v_#memory_$Pointer$.base_52|]} [2019-11-15 19:54:48,358 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:54:48,359 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 19 treesize of output 18 [2019-11-15 19:54:48,360 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:54:48,396 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:54:48,465 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:54:48,465 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 83 treesize of output 112 [2019-11-15 19:54:48,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:54:48,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:54:48,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:54:48,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:54:48,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:54:48,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:54:48,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:54:48,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:54:48,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:54:48,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:54:48,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:54:48,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:54:48,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:54:48,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:54:48,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:54:48,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:54:48,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:54:48,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:54:48,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:54:48,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:54:48,488 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-15 19:54:48,581 INFO L567 ElimStorePlain]: treesize reduction 60, result has 51.2 percent of original size [2019-11-15 19:54:48,582 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 19:54:48,582 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:104, output treesize:65 [2019-11-15 19:54:48,653 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:54:48,654 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 66 treesize of output 29 [2019-11-15 19:54:48,654 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:54:48,675 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:54:48,721 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:54:48,721 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 119 treesize of output 147 [2019-11-15 19:54:48,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:54:48,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:54:48,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:54:48,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:54:48,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:54:48,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:54:48,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:54:48,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:54:48,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:54:48,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:54:48,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:54:48,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:54:48,731 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:54:48,803 INFO L567 ElimStorePlain]: treesize reduction 661, result has 11.6 percent of original size [2019-11-15 19:54:48,804 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 19:54:48,804 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:172, output treesize:86 [2019-11-15 19:54:48,977 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:54:48,978 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 83 treesize of output 50 [2019-11-15 19:54:48,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:54:48,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:54:48,979 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-15 19:54:49,017 INFO L567 ElimStorePlain]: treesize reduction 12, result has 80.3 percent of original size [2019-11-15 19:54:49,022 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 22 treesize of output 10 [2019-11-15 19:54:49,022 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:54:49,034 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:54:49,035 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 19:54:49,036 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:100, output treesize:18 [2019-11-15 19:54:49,171 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-15 19:54:49,171 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 19:54:49,172 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19] total 34 [2019-11-15 19:54:49,172 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233380802] [2019-11-15 19:54:49,173 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-11-15 19:54:49,173 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:54:49,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-11-15 19:54:49,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1073, Unknown=0, NotChecked=0, Total=1190 [2019-11-15 19:54:49,174 INFO L87 Difference]: Start difference. First operand 147 states and 159 transitions. Second operand 35 states. [2019-11-15 19:54:53,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:54:53,550 INFO L93 Difference]: Finished difference Result 254 states and 275 transitions. [2019-11-15 19:54:53,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-11-15 19:54:53,550 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 42 [2019-11-15 19:54:53,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:54:53,552 INFO L225 Difference]: With dead ends: 254 [2019-11-15 19:54:53,552 INFO L226 Difference]: Without dead ends: 254 [2019-11-15 19:54:53,554 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 24 SyntacticMatches, 4 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 692 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=471, Invalid=3069, Unknown=0, NotChecked=0, Total=3540 [2019-11-15 19:54:53,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2019-11-15 19:54:53,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 172. [2019-11-15 19:54:53,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-11-15 19:54:53,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 188 transitions. [2019-11-15 19:54:53,558 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 188 transitions. Word has length 42 [2019-11-15 19:54:53,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:54:53,559 INFO L462 AbstractCegarLoop]: Abstraction has 172 states and 188 transitions. [2019-11-15 19:54:53,559 INFO L463 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-11-15 19:54:53,559 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 188 transitions. [2019-11-15 19:54:53,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-15 19:54:53,560 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:54:53,560 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] [2019-11-15 19:54:53,763 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 19:54:53,764 INFO L410 AbstractCegarLoop]: === Iteration 25 === [mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr56ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION]=== [2019-11-15 19:54:53,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:54:53,764 INFO L82 PathProgramCache]: Analyzing trace with hash 1300671820, now seen corresponding path program 1 times [2019-11-15 19:54:53,764 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:54:53,764 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757604789] [2019-11-15 19:54:53,764 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:53,764 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:53,765 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:54:53,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:54:54,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:54:54,195 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-15 19:54:54,195 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757604789] [2019-11-15 19:54:54,195 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [528097729] [2019-11-15 19:54:54,196 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_37a8eefb-eaae-47ec-a330-6064ca78fc56/bin/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 19:54:54,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:54:54,393 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 39 conjunts are in the unsatisfiable core [2019-11-15 19:54:54,395 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:54:54,408 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:54:54,408 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-15 19:54:54,409 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:54:54,416 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:54:54,416 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:54:54,416 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2019-11-15 19:54:54,426 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-15 19:54:54,427 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:54:54,438 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:54:54,438 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:54:54,438 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:20 [2019-11-15 19:54:54,468 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:54:54,470 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 19 treesize of output 18 [2019-11-15 19:54:54,471 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:54:54,479 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:54:54,479 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:54:54,479 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:24 [2019-11-15 19:54:54,530 INFO L341 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-11-15 19:54:54,531 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 34 treesize of output 21 [2019-11-15 19:54:54,531 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:54:54,539 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:54:54,539 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:54:54,539 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:43, output treesize:24 [2019-11-15 19:54:54,547 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:54:54,547 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-15 19:54:54,548 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:54:54,555 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:54:54,555 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:54:54,555 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:23 [2019-11-15 19:54:54,596 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 26 treesize of output 21 [2019-11-15 19:54:54,596 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:54:54,609 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:54:54,610 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:54:54,610 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:25 [2019-11-15 19:54:54,800 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:54:54,800 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 52 treesize of output 101 [2019-11-15 19:54:54,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:54:54,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:54:54,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:54:54,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:54:54,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:54:54,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:54:54,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:54:54,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:54:54,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:54:54,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:54:54,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:54:54,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:54:54,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:54:54,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:54:54,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:54:54,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:54:54,813 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-15 19:54:54,866 INFO L567 ElimStorePlain]: treesize reduction 52, result has 45.3 percent of original size [2019-11-15 19:54:54,867 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 19:54:54,867 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:52, output treesize:41 [2019-11-15 19:54:54,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:54:54,930 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:54:54,931 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 49 treesize of output 69 [2019-11-15 19:54:54,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:54:54,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:54:54,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:54:54,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:54:54,932 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-11-15 19:54:54,993 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:54:54,993 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 73 treesize of output 129 [2019-11-15 19:54:54,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:54:54,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:54:54,996 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:54:55,028 INFO L567 ElimStorePlain]: treesize reduction 282, result has 6.0 percent of original size [2019-11-15 19:54:55,028 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-15 19:54:55,029 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:123, output treesize:18 [2019-11-15 19:54:55,085 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 25 treesize of output 13 [2019-11-15 19:54:55,085 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:54:55,089 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:54:55,089 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-15 19:54:55,090 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:5 [2019-11-15 19:54:55,095 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-15 19:54:55,096 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 19:54:55,096 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 24 [2019-11-15 19:54:55,096 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290237557] [2019-11-15 19:54:55,096 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-11-15 19:54:55,096 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:54:55,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-11-15 19:54:55,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=521, Unknown=0, NotChecked=0, Total=600 [2019-11-15 19:54:55,097 INFO L87 Difference]: Start difference. First operand 172 states and 188 transitions. Second operand 25 states. [2019-11-15 19:54:56,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:54:56,640 INFO L93 Difference]: Finished difference Result 224 states and 243 transitions. [2019-11-15 19:54:56,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-11-15 19:54:56,641 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 42 [2019-11-15 19:54:56,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:54:56,642 INFO L225 Difference]: With dead ends: 224 [2019-11-15 19:54:56,642 INFO L226 Difference]: Without dead ends: 224 [2019-11-15 19:54:56,643 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 32 SyntacticMatches, 6 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 391 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=285, Invalid=1437, Unknown=0, NotChecked=0, Total=1722 [2019-11-15 19:54:56,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2019-11-15 19:54:56,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 172. [2019-11-15 19:54:56,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-11-15 19:54:56,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 187 transitions. [2019-11-15 19:54:56,647 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 187 transitions. Word has length 42 [2019-11-15 19:54:56,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:54:56,648 INFO L462 AbstractCegarLoop]: Abstraction has 172 states and 187 transitions. [2019-11-15 19:54:56,648 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-11-15 19:54:56,648 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 187 transitions. [2019-11-15 19:54:56,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-15 19:54:56,649 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:54:56,649 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, 1, 1, 1, 1, 1, 1] [2019-11-15 19:54:56,853 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 19:54:56,853 INFO L410 AbstractCegarLoop]: === Iteration 26 === [mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr56ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION]=== [2019-11-15 19:54:56,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:54:56,854 INFO L82 PathProgramCache]: Analyzing trace with hash 453331517, now seen corresponding path program 1 times [2019-11-15 19:54:56,854 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:54:56,854 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358814987] [2019-11-15 19:54:56,854 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:56,854 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:56,854 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:54:56,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:54:57,211 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 25 [2019-11-15 19:54:57,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:54:57,522 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-15 19:54:57,522 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358814987] [2019-11-15 19:54:57,522 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2004875020] [2019-11-15 19:54:57,523 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_37a8eefb-eaae-47ec-a330-6064ca78fc56/bin/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 19:54:57,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:54:57,709 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-15 19:54:57,711 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:54:57,801 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:54:57,801 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-15 19:54:57,802 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:54:57,827 INFO L567 ElimStorePlain]: treesize reduction 14, result has 63.2 percent of original size [2019-11-15 19:54:57,827 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:54:57,827 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2019-11-15 19:54:57,865 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-15 19:54:57,865 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:54:57,877 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:54:57,877 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:54:57,878 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:32 [2019-11-15 19:54:58,000 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:54:58,000 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 1 case distinctions, treesize of input 36 treesize of output 51 [2019-11-15 19:54:58,001 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:54:58,027 INFO L567 ElimStorePlain]: treesize reduction 24, result has 57.1 percent of original size [2019-11-15 19:54:58,027 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:54:58,027 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:44, output treesize:25 [2019-11-15 19:54:58,077 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:54:58,078 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 49 treesize of output 69 [2019-11-15 19:54:58,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:54:58,079 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:54:58,097 INFO L567 ElimStorePlain]: treesize reduction 32, result has 44.8 percent of original size [2019-11-15 19:54:58,097 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:54:58,097 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:57, output treesize:26 [2019-11-15 19:54:58,137 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 25 treesize of output 13 [2019-11-15 19:54:58,137 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:54:58,144 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:54:58,144 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:54:58,144 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:18 [2019-11-15 19:54:58,297 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 17 treesize of output 17 [2019-11-15 19:54:58,298 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:54:58,308 INFO L567 ElimStorePlain]: treesize reduction 4, result has 73.3 percent of original size [2019-11-15 19:54:58,309 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 19:54:58,309 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:11 [2019-11-15 19:54:58,358 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 19:54:58,358 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 19:54:58,358 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 12] total 29 [2019-11-15 19:54:58,359 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603641133] [2019-11-15 19:54:58,359 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-11-15 19:54:58,359 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:54:58,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-11-15 19:54:58,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=775, Unknown=0, NotChecked=0, Total=870 [2019-11-15 19:54:58,362 INFO L87 Difference]: Start difference. First operand 172 states and 187 transitions. Second operand 30 states. [2019-11-15 19:55:01,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:55:01,366 INFO L93 Difference]: Finished difference Result 214 states and 231 transitions. [2019-11-15 19:55:01,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-11-15 19:55:01,366 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 44 [2019-11-15 19:55:01,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:55:01,367 INFO L225 Difference]: With dead ends: 214 [2019-11-15 19:55:01,368 INFO L226 Difference]: Without dead ends: 214 [2019-11-15 19:55:01,369 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 35 SyntacticMatches, 3 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 813 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=671, Invalid=2635, Unknown=0, NotChecked=0, Total=3306 [2019-11-15 19:55:01,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-11-15 19:55:01,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 181. [2019-11-15 19:55:01,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-11-15 19:55:01,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 198 transitions. [2019-11-15 19:55:01,374 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 198 transitions. Word has length 44 [2019-11-15 19:55:01,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:55:01,375 INFO L462 AbstractCegarLoop]: Abstraction has 181 states and 198 transitions. [2019-11-15 19:55:01,375 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-11-15 19:55:01,375 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 198 transitions. [2019-11-15 19:55:01,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-15 19:55:01,375 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:55:01,376 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, 1, 1, 1, 1, 1, 1] [2019-11-15 19:55:01,576 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 19:55:01,576 INFO L410 AbstractCegarLoop]: === Iteration 27 === [mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr56ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION]=== [2019-11-15 19:55:01,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:55:01,577 INFO L82 PathProgramCache]: Analyzing trace with hash 453331518, now seen corresponding path program 1 times [2019-11-15 19:55:01,577 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:55:01,577 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741075848] [2019-11-15 19:55:01,577 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:55:01,577 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:55:01,577 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:55:01,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:55:02,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:55:02,177 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 19:55:02,178 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741075848] [2019-11-15 19:55:02,178 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1965948034] [2019-11-15 19:55:02,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_37a8eefb-eaae-47ec-a330-6064ca78fc56/bin/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 19:55:02,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:55:02,365 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 32 conjunts are in the unsatisfiable core [2019-11-15 19:55:02,367 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:55:02,421 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:55:02,421 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-15 19:55:02,422 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:55:02,441 INFO L567 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-11-15 19:55:02,442 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:55:02,442 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-11-15 19:55:02,590 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:55:02,591 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 34 [2019-11-15 19:55:02,591 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:55:02,602 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:55:02,602 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:55:02,602 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:18 [2019-11-15 19:55:02,640 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 19:55:02,640 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:55:02,650 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:55:02,650 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:55:02,651 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:26 [2019-11-15 19:55:02,764 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:55:02,764 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 1 case distinctions, treesize of input 35 treesize of output 50 [2019-11-15 19:55:02,765 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:55:02,800 INFO L567 ElimStorePlain]: treesize reduction 24, result has 52.0 percent of original size [2019-11-15 19:55:02,800 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:55:02,801 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:26 [2019-11-15 19:55:02,924 INFO L341 Elim1Store]: treesize reduction 38, result has 56.3 percent of original size [2019-11-15 19:55:02,924 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 59 treesize of output 78 [2019-11-15 19:55:02,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:55:02,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:55:02,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:55:02,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:55:02,927 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-11-15 19:55:02,954 INFO L567 ElimStorePlain]: treesize reduction 80, result has 28.6 percent of original size [2019-11-15 19:55:02,955 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-15 19:55:02,955 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:62, output treesize:31 [2019-11-15 19:55:03,090 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:55:03,090 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 35 treesize of output 30 [2019-11-15 19:55:03,090 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:55:03,104 INFO L567 ElimStorePlain]: treesize reduction 12, result has 50.0 percent of original size [2019-11-15 19:55:03,105 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-15 19:55:03,105 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:8 [2019-11-15 19:55:03,200 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 19:55:03,201 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 19:55:03,201 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15] total 31 [2019-11-15 19:55:03,201 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686014837] [2019-11-15 19:55:03,201 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-11-15 19:55:03,201 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:55:03,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-11-15 19:55:03,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=829, Unknown=0, NotChecked=0, Total=930 [2019-11-15 19:55:03,202 INFO L87 Difference]: Start difference. First operand 181 states and 198 transitions. Second operand 31 states. [2019-11-15 19:55:05,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:55:05,661 INFO L93 Difference]: Finished difference Result 197 states and 210 transitions. [2019-11-15 19:55:05,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-11-15 19:55:05,661 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 44 [2019-11-15 19:55:05,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:55:05,662 INFO L225 Difference]: With dead ends: 197 [2019-11-15 19:55:05,662 INFO L226 Difference]: Without dead ends: 197 [2019-11-15 19:55:05,664 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 521 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=549, Invalid=2421, Unknown=0, NotChecked=0, Total=2970 [2019-11-15 19:55:05,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-11-15 19:55:05,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 168. [2019-11-15 19:55:05,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-15 19:55:05,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 180 transitions. [2019-11-15 19:55:05,669 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 180 transitions. Word has length 44 [2019-11-15 19:55:05,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:55:05,669 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 180 transitions. [2019-11-15 19:55:05,669 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-11-15 19:55:05,669 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 180 transitions. [2019-11-15 19:55:05,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-15 19:55:05,670 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:55:05,670 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-15 19:55:05,874 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 19:55:05,875 INFO L410 AbstractCegarLoop]: === Iteration 28 === [mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr56ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION]=== [2019-11-15 19:55:05,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:55:05,875 INFO L82 PathProgramCache]: Analyzing trace with hash -997117725, now seen corresponding path program 3 times [2019-11-15 19:55:05,875 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:55:05,875 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745816466] [2019-11-15 19:55:05,875 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:55:05,875 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:55:05,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:55:05,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:55:06,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:55:06,426 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 19:55:06,426 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745816466] [2019-11-15 19:55:06,426 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [500959046] [2019-11-15 19:55:06,427 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_37a8eefb-eaae-47ec-a330-6064ca78fc56/bin/uautomizer/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 19:55:06,728 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-15 19:55:06,728 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 19:55:06,731 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 57 conjunts are in the unsatisfiable core [2019-11-15 19:55:06,733 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:55:06,739 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-15 19:55:06,740 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:55:06,745 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:55:06,745 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:55:06,745 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-15 19:55:06,853 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:55:06,853 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-15 19:55:06,854 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:55:06,900 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.9 percent of original size [2019-11-15 19:55:06,901 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:55:06,901 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2019-11-15 19:55:06,941 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-15 19:55:06,941 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:55:06,959 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:55:06,963 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-15 19:55:06,963 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:55:06,979 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:55:06,980 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-15 19:55:06,980 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:49, output treesize:39 [2019-11-15 19:55:07,143 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:55:07,143 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 1 case distinctions, treesize of input 36 treesize of output 51 [2019-11-15 19:55:07,144 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:55:07,188 INFO L567 ElimStorePlain]: treesize reduction 24, result has 70.4 percent of original size [2019-11-15 19:55:07,191 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 26 treesize of output 21 [2019-11-15 19:55:07,192 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:55:07,224 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:55:07,224 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:55:07,224 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:69, output treesize:53 [2019-11-15 19:55:07,291 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:55:07,292 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 34 treesize of output 21 [2019-11-15 19:55:07,292 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:55:07,341 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:55:07,346 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:55:07,349 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 41 treesize of output 24 [2019-11-15 19:55:07,349 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:55:07,385 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:55:07,385 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:55:07,386 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:98, output treesize:60 [2019-11-15 19:55:07,519 INFO L392 ElimStorePlain]: Different costs {1=[|v_#length_57|], 3=[|v_#valid_92|]} [2019-11-15 19:55:07,525 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:55:07,526 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2019-11-15 19:55:07,526 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:55:07,559 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:55:07,587 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:55:07,587 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2019-11-15 19:55:07,587 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:55:07,617 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:55:07,617 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:55:07,617 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:74, output treesize:66 [2019-11-15 19:55:07,685 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 26 treesize of output 21 [2019-11-15 19:55:07,685 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:55:07,711 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:55:07,715 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 33 treesize of output 24 [2019-11-15 19:55:07,716 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:55:07,739 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:55:07,740 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-15 19:55:07,740 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:85, output treesize:68 [2019-11-15 19:55:07,956 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:55:07,956 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 94 treesize of output 123 [2019-11-15 19:55:07,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:55:07,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:55:07,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:55:07,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:55:07,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:55:07,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:55:07,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:55:07,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:55:07,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:55:07,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:55:07,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:55:07,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:55:07,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:55:07,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:55:07,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:55:07,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:55:07,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:55:07,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:55:07,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:55:07,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:55:07,977 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 19:55:08,090 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2019-11-15 19:55:08,090 INFO L567 ElimStorePlain]: treesize reduction 48, result has 67.6 percent of original size [2019-11-15 19:55:08,133 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:55:08,133 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 2 case distinctions, treesize of input 40 treesize of output 82 [2019-11-15 19:55:08,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:55:08,134 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:55:08,247 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 58 [2019-11-15 19:55:08,247 INFO L567 ElimStorePlain]: treesize reduction 35, result has 75.7 percent of original size [2019-11-15 19:55:08,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:55:08,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:55:08,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:55:08,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:55:08,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:55:08,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:55:08,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:55:08,255 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-15 19:55:08,255 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:122, output treesize:109 [2019-11-15 19:55:08,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:55:08,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:55:08,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:55:08,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:55:08,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:55:08,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:55:08,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:55:08,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:55:08,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:55:08,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:55:08,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:55:08,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:55:08,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:55:08,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:55:08,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:55:08,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:55:08,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:55:08,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:55:08,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:55:08,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:55:08,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:55:08,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:55:08,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:55:08,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:55:08,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:55:08,813 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 105 treesize of output 88 [2019-11-15 19:55:08,814 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:55:08,844 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 19:55:08,902 INFO L341 Elim1Store]: treesize reduction 20, result has 58.3 percent of original size [2019-11-15 19:55:08,902 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 122 treesize of output 100 [2019-11-15 19:55:08,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:55:08,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:55:08,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:55:08,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:55:08,905 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-15 19:55:08,933 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 94 treesize of output 77 [2019-11-15 19:55:08,934 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 19:55:09,023 INFO L341 Elim1Store]: treesize reduction 20, result has 70.6 percent of original size [2019-11-15 19:55:09,024 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 133 treesize of output 138 [2019-11-15 19:55:09,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:55:09,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:55:09,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:55:09,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:55:09,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:55:09,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:55:09,028 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 19:55:09,050 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:55:09,051 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 128 treesize of output 101 [2019-11-15 19:55:09,052 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-15 19:55:09,837 WARN L191 SmtUtils]: Spent 785.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 111 [2019-11-15 19:55:09,838 INFO L567 ElimStorePlain]: treesize reduction 186, result has 67.8 percent of original size [2019-11-15 19:55:09,915 INFO L341 Elim1Store]: treesize reduction 28, result has 63.2 percent of original size [2019-11-15 19:55:09,915 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 117 treesize of output 143 [2019-11-15 19:55:09,916 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-15 19:55:09,934 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 85 [2019-11-15 19:55:09,935 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-15 19:55:09,966 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 79 treesize of output 70 [2019-11-15 19:55:09,966 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-15 19:55:09,976 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 76 [2019-11-15 19:55:09,976 INFO L496 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-11-15 19:55:10,245 WARN L191 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 96 [2019-11-15 19:55:10,245 INFO L567 ElimStorePlain]: treesize reduction 36, result has 90.2 percent of original size [2019-11-15 19:55:10,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:55:10,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:55:10,249 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 7 dim-0 vars, and 4 xjuncts. [2019-11-15 19:55:10,249 INFO L221 ElimStorePlain]: Needed 10 recursive calls to eliminate 6 variables, input treesize:583, output treesize:345 [2019-11-15 19:55:10,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:55:10,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:55:10,529 WARN L191 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 94 [2019-11-15 19:55:10,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:55:10,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:55:10,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:55:10,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:55:10,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:55:10,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:55:10,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 19:55:11,009 INFO L392 ElimStorePlain]: Different costs {1=[v_prenex_8, v_prenex_10, v_prenex_11, v_prenex_7], 2=[v_prenex_14, v_prenex_13], 5=[|#memory_$Pointer$.base|, |#memory_$Pointer$.offset|]} [2019-11-15 19:55:11,025 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 85 treesize of output 65 [2019-11-15 19:55:11,026 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:55:11,277 WARN L191 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 126 [2019-11-15 19:55:11,278 INFO L567 ElimStorePlain]: treesize reduction 8, result has 97.6 percent of original size [2019-11-15 19:55:11,298 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:55:11,298 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 64 [2019-11-15 19:55:11,299 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:55:11,591 WARN L191 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 119 [2019-11-15 19:55:11,591 INFO L567 ElimStorePlain]: treesize reduction 8, result has 97.4 percent of original size [2019-11-15 19:55:11,601 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 47 treesize of output 31 [2019-11-15 19:55:11,602 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 19:55:11,733 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2019-11-15 19:55:11,733 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:55:11,747 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:55:11,747 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 46 [2019-11-15 19:55:11,748 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 19:55:12,019 WARN L191 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 103 [2019-11-15 19:55:12,019 INFO L567 ElimStorePlain]: treesize reduction 8, result has 96.8 percent of original size [2019-11-15 19:55:12,029 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 75 treesize of output 63 [2019-11-15 19:55:12,029 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-15 19:55:12,151 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2019-11-15 19:55:12,152 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:55:12,160 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 57 treesize of output 37 [2019-11-15 19:55:12,161 INFO L496 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 19:55:12,271 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-11-15 19:55:12,271 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:55:12,310 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:55:12,310 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 114 treesize of output 101 [2019-11-15 19:55:12,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:55:12,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:55:12,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:55:12,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:55:12,313 INFO L496 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 19:55:12,511 WARN L191 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 91 [2019-11-15 19:55:12,511 INFO L567 ElimStorePlain]: treesize reduction 12, result has 93.4 percent of original size [2019-11-15 19:55:12,713 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 19:55:12,713 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-15 19:55:12,717 INFO L168 Benchmark]: Toolchain (without parser) took 55254.37 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 490.7 MB). Free memory was 940.7 MB in the beginning and 888.7 MB in the end (delta: 52.0 MB). Peak memory consumption was 542.8 MB. Max. memory is 11.5 GB. [2019-11-15 19:55:12,717 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 19:55:12,718 INFO L168 Benchmark]: CACSL2BoogieTranslator took 733.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.4 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -169.3 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2019-11-15 19:55:12,719 INFO L168 Benchmark]: Boogie Preprocessor took 77.81 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-15 19:55:12,719 INFO L168 Benchmark]: RCFGBuilder took 831.01 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: 60.0 MB). Peak memory consumption was 60.0 MB. Max. memory is 11.5 GB. [2019-11-15 19:55:12,720 INFO L168 Benchmark]: TraceAbstraction took 53600.22 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 363.3 MB). Free memory was 1.0 GB in the beginning and 888.7 MB in the end (delta: 155.9 MB). Peak memory consumption was 519.2 MB. Max. memory is 11.5 GB. [2019-11-15 19:55:12,721 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.24 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 733.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.4 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -169.3 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 77.81 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 831.01 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: 60.0 MB). Peak memory consumption was 60.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 53600.22 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 363.3 MB). Free memory was 1.0 GB in the beginning and 888.7 MB in the end (delta: 155.9 MB). Peak memory consumption was 519.2 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-15 19:55:15,222 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 19:55:15,224 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 19:55:15,244 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 19:55:15,245 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 19:55:15,246 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 19:55:15,249 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 19:55:15,260 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 19:55:15,265 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 19:55:15,268 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 19:55:15,270 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 19:55:15,273 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 19:55:15,274 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 19:55:15,276 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 19:55:15,277 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 19:55:15,279 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 19:55:15,281 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 19:55:15,284 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 19:55:15,287 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 19:55:15,291 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 19:55:15,295 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 19:55:15,297 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 19:55:15,300 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 19:55:15,303 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 19:55:15,306 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 19:55:15,307 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 19:55:15,307 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 19:55:15,309 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 19:55:15,309 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 19:55:15,312 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 19:55:15,313 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 19:55:15,313 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 19:55:15,315 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 19:55:15,315 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 19:55:15,317 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 19:55:15,317 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 19:55:15,318 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 19:55:15,318 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 19:55:15,319 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 19:55:15,320 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 19:55:15,321 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 19:55:15,322 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_37a8eefb-eaae-47ec-a330-6064ca78fc56/bin/uautomizer/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf [2019-11-15 19:55:15,351 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 19:55:15,352 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 19:55:15,353 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 19:55:15,353 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 19:55:15,353 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 19:55:15,354 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 19:55:15,354 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 19:55:15,354 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 19:55:15,354 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 19:55:15,355 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 19:55:15,355 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 19:55:15,355 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-15 19:55:15,355 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-15 19:55:15,355 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 19:55:15,356 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-15 19:55:15,356 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-15 19:55:15,356 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 19:55:15,356 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 19:55:15,356 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 19:55:15,357 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 19:55:15,357 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 19:55:15,357 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 19:55:15,357 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 19:55:15,357 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 19:55:15,358 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 19:55:15,358 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-15 19:55:15,358 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-15 19:55:15,358 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-15 19:55:15,358 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_37a8eefb-eaae-47ec-a330-6064ca78fc56/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-memcleanup) ) 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 -> d9f9c3b0fdd5428a38e0eab9236fadbdbb3aa880 [2019-11-15 19:55:15,416 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 19:55:15,438 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 19:55:15,442 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 19:55:15,444 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 19:55:15,444 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 19:55:15,445 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_37a8eefb-eaae-47ec-a330-6064ca78fc56/bin/uautomizer/../../sv-benchmarks/c/forester-heap/sll-rb-sentinel-2.i [2019-11-15 19:55:15,530 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_37a8eefb-eaae-47ec-a330-6064ca78fc56/bin/uautomizer/data/35b64a37d/bf131bce5ab4439b8e72bf2ce8f6c3ae/FLAGf92e38c38 [2019-11-15 19:55:16,118 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 19:55:16,119 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_37a8eefb-eaae-47ec-a330-6064ca78fc56/sv-benchmarks/c/forester-heap/sll-rb-sentinel-2.i [2019-11-15 19:55:16,135 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_37a8eefb-eaae-47ec-a330-6064ca78fc56/bin/uautomizer/data/35b64a37d/bf131bce5ab4439b8e72bf2ce8f6c3ae/FLAGf92e38c38 [2019-11-15 19:55:16,392 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_37a8eefb-eaae-47ec-a330-6064ca78fc56/bin/uautomizer/data/35b64a37d/bf131bce5ab4439b8e72bf2ce8f6c3ae [2019-11-15 19:55:16,396 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 19:55:16,399 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-15 19:55:16,400 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 19:55:16,400 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 19:55:16,404 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 19:55:16,405 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 07:55:16" (1/1) ... [2019-11-15 19:55:16,408 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6277e991 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:55:16, skipping insertion in model container [2019-11-15 19:55:16,408 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 07:55:16" (1/1) ... [2019-11-15 19:55:16,416 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 19:55:16,482 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 19:55:16,907 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 19:55:16,921 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 19:55:16,975 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 19:55:17,056 INFO L192 MainTranslator]: Completed translation [2019-11-15 19:55:17,056 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:55:17 WrapperNode [2019-11-15 19:55:17,057 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 19:55:17,058 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 19:55:17,058 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 19:55:17,059 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 19:55:17,072 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:55:17" (1/1) ... [2019-11-15 19:55:17,072 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:55:17" (1/1) ... [2019-11-15 19:55:17,094 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:55:17" (1/1) ... [2019-11-15 19:55:17,094 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:55:17" (1/1) ... [2019-11-15 19:55:17,119 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:55:17" (1/1) ... [2019-11-15 19:55:17,135 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:55:17" (1/1) ... [2019-11-15 19:55:17,140 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:55:17" (1/1) ... [2019-11-15 19:55:17,148 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 19:55:17,149 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 19:55:17,149 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 19:55:17,149 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 19:55:17,150 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:55:17" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_37a8eefb-eaae-47ec-a330-6064ca78fc56/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-15 19:55:17,210 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-15 19:55:17,210 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 19:55:17,211 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-15 19:55:17,211 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-15 19:55:17,211 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-15 19:55:17,211 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-15 19:55:17,212 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-15 19:55:17,212 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-15 19:55:17,212 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-15 19:55:17,213 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-15 19:55:17,213 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-15 19:55:17,213 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-15 19:55:17,213 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-15 19:55:17,214 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-15 19:55:17,214 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-15 19:55:17,214 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-15 19:55:17,214 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-15 19:55:17,215 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-15 19:55:17,215 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-15 19:55:17,215 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-15 19:55:17,215 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-15 19:55:17,216 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-15 19:55:17,216 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-15 19:55:17,216 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-15 19:55:17,217 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-15 19:55:17,217 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-15 19:55:17,217 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-15 19:55:17,217 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-15 19:55:17,217 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-15 19:55:17,218 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-15 19:55:17,218 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-15 19:55:17,218 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-15 19:55:17,218 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-15 19:55:17,219 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-15 19:55:17,219 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-15 19:55:17,219 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-15 19:55:17,219 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-15 19:55:17,220 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-15 19:55:17,220 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-15 19:55:17,220 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-15 19:55:17,220 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-15 19:55:17,220 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-15 19:55:17,220 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-15 19:55:17,220 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-15 19:55:17,221 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-15 19:55:17,221 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-15 19:55:17,221 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-15 19:55:17,221 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-15 19:55:17,221 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-15 19:55:17,221 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-15 19:55:17,221 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-15 19:55:17,221 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-15 19:55:17,221 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-15 19:55:17,222 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-15 19:55:17,222 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-15 19:55:17,222 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-15 19:55:17,222 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-15 19:55:17,222 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-15 19:55:17,222 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-15 19:55:17,223 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-15 19:55:17,223 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-15 19:55:17,223 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-15 19:55:17,223 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-15 19:55:17,223 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-15 19:55:17,223 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-15 19:55:17,223 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-15 19:55:17,224 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-15 19:55:17,224 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-15 19:55:17,224 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-15 19:55:17,224 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-15 19:55:17,224 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-15 19:55:17,224 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-15 19:55:17,225 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-15 19:55:17,225 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-15 19:55:17,225 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-15 19:55:17,225 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-15 19:55:17,226 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-15 19:55:17,226 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-15 19:55:17,226 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-15 19:55:17,226 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-15 19:55:17,227 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-15 19:55:17,227 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-15 19:55:17,227 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-15 19:55:17,227 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-15 19:55:17,227 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-15 19:55:17,228 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-15 19:55:17,228 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-15 19:55:17,228 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-15 19:55:17,228 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-15 19:55:17,228 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-15 19:55:17,228 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-15 19:55:17,228 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-15 19:55:17,229 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-15 19:55:17,229 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-15 19:55:17,229 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-15 19:55:17,229 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-15 19:55:17,229 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-15 19:55:17,229 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-15 19:55:17,229 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-15 19:55:17,229 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-15 19:55:17,230 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-15 19:55:17,230 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-15 19:55:17,230 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-15 19:55:17,230 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-15 19:55:17,230 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-15 19:55:17,231 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-15 19:55:17,231 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-15 19:55:17,231 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-15 19:55:17,231 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-15 19:55:17,231 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-15 19:55:17,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-15 19:55:17,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-15 19:55:17,232 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-15 19:55:17,232 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-15 19:55:17,232 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 19:55:17,233 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-15 19:55:17,233 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 19:55:18,393 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 19:55:18,393 INFO L284 CfgBuilder]: Removed 11 assume(true) statements. [2019-11-15 19:55:18,395 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 07:55:18 BoogieIcfgContainer [2019-11-15 19:55:18,395 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 19:55:18,396 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 19:55:18,396 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 19:55:18,400 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 19:55:18,400 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 07:55:16" (1/3) ... [2019-11-15 19:55:18,403 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@645dea25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 07:55:18, skipping insertion in model container [2019-11-15 19:55:18,403 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:55:17" (2/3) ... [2019-11-15 19:55:18,404 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@645dea25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 07:55:18, skipping insertion in model container [2019-11-15 19:55:18,404 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 07:55:18" (3/3) ... [2019-11-15 19:55:18,409 INFO L109 eAbstractionObserver]: Analyzing ICFG sll-rb-sentinel-2.i [2019-11-15 19:55:18,421 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 19:55:18,438 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 57 error locations. [2019-11-15 19:55:18,451 INFO L249 AbstractCegarLoop]: Starting to check reachability of 57 error locations. [2019-11-15 19:55:18,481 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 19:55:18,481 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-15 19:55:18,481 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 19:55:18,481 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 19:55:18,482 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 19:55:18,482 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 19:55:18,483 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 19:55:18,483 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 19:55:18,513 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states. [2019-11-15 19:55:18,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-15 19:55:18,528 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:55:18,538 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:55:18,542 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr56ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-15 19:55:18,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:55:18,549 INFO L82 PathProgramCache]: Analyzing trace with hash 2095448578, now seen corresponding path program 1 times [2019-11-15 19:55:18,561 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 19:55:18,562 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [271522271] [2019-11-15 19:55:18,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_37a8eefb-eaae-47ec-a330-6064ca78fc56/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-15 19:55:18,800 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 19:55:18,801 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-15 19:55:18,807 INFO L168 Benchmark]: Toolchain (without parser) took 2407.36 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 159.9 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -111.7 MB). Peak memory consumption was 48.2 MB. Max. memory is 11.5 GB. [2019-11-15 19:55:18,807 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 1.0 GB. Free memory is still 977.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 19:55:18,811 INFO L168 Benchmark]: CACSL2BoogieTranslator took 658.21 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 159.9 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -195.2 MB). Peak memory consumption was 23.5 MB. Max. memory is 11.5 GB. [2019-11-15 19:55:18,813 INFO L168 Benchmark]: Boogie Preprocessor took 90.29 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-11-15 19:55:18,815 INFO L168 Benchmark]: RCFGBuilder took 1245.96 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: 64.0 MB). Peak memory consumption was 64.0 MB. Max. memory is 11.5 GB. [2019-11-15 19:55:18,815 INFO L168 Benchmark]: TraceAbstraction took 408.26 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: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 11.5 GB. [2019-11-15 19:55:18,827 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.30 ms. Allocated memory is still 1.0 GB. Free memory is still 977.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 658.21 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 159.9 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -195.2 MB). Peak memory consumption was 23.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 90.29 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1245.96 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: 64.0 MB). Peak memory consumption was 64.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 408.26 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: 13.1 MB). Peak memory consumption was 13.1 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...