./Ultimate.py --spec ../../sv-benchmarks/c/MemSafety.prp --file ../../sv-benchmarks/c/forester-heap/dll-rb-sentinel_false-unreach-call_false-valid-memtrack.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_d64cda5f-b449-499c-abc1-5cd796bc5494/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_d64cda5f-b449-499c-abc1-5cd796bc5494/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_d64cda5f-b449-499c-abc1-5cd796bc5494/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_d64cda5f-b449-499c-abc1-5cd796bc5494/bin-2019/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/dll-rb-sentinel_false-unreach-call_false-valid-memtrack.i -s /tmp/vcloud-vcloud-master/worker/working_dir_d64cda5f-b449-499c-abc1-5cd796bc5494/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_d64cda5f-b449-499c-abc1-5cd796bc5494/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b9633ec6dc7e01a7231c1be5ed310faef61ba6b0 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_d64cda5f-b449-499c-abc1-5cd796bc5494/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_d64cda5f-b449-499c-abc1-5cd796bc5494/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_d64cda5f-b449-499c-abc1-5cd796bc5494/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_d64cda5f-b449-499c-abc1-5cd796bc5494/bin-2019/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/dll-rb-sentinel_false-unreach-call_false-valid-memtrack.i -s /tmp/vcloud-vcloud-master/worker/working_dir_d64cda5f-b449-499c-abc1-5cd796bc5494/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_d64cda5f-b449-499c-abc1-5cd796bc5494/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b9633ec6dc7e01a7231c1be5ed310faef61ba6b0 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 00:38:07,331 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 00:38:07,332 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 00:38:07,339 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 00:38:07,340 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 00:38:07,340 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 00:38:07,341 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 00:38:07,342 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 00:38:07,343 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 00:38:07,344 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 00:38:07,345 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 00:38:07,345 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 00:38:07,346 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 00:38:07,346 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 00:38:07,347 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 00:38:07,348 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 00:38:07,349 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 00:38:07,350 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 00:38:07,351 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 00:38:07,352 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 00:38:07,353 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 00:38:07,354 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 00:38:07,356 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 00:38:07,356 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 00:38:07,356 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 00:38:07,357 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 00:38:07,358 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 00:38:07,358 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 00:38:07,359 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 00:38:07,360 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 00:38:07,360 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 00:38:07,361 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 00:38:07,361 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 00:38:07,361 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 00:38:07,362 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 00:38:07,362 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 00:38:07,362 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_d64cda5f-b449-499c-abc1-5cd796bc5494/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2018-11-10 00:38:07,372 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 00:38:07,372 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 00:38:07,373 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 00:38:07,373 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 00:38:07,374 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 00:38:07,374 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 00:38:07,374 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 00:38:07,374 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 00:38:07,374 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 00:38:07,374 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 00:38:07,375 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 00:38:07,375 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-11-10 00:38:07,375 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-11-10 00:38:07,375 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-11-10 00:38:07,375 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 00:38:07,375 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 00:38:07,375 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 00:38:07,375 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 00:38:07,376 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 00:38:07,376 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 00:38:07,376 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 00:38:07,376 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 00:38:07,376 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 00:38:07,376 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 00:38:07,376 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 00:38:07,377 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_d64cda5f-b449-499c-abc1-5cd796bc5494/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b9633ec6dc7e01a7231c1be5ed310faef61ba6b0 [2018-11-10 00:38:07,401 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 00:38:07,409 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 00:38:07,411 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 00:38:07,412 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 00:38:07,412 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 00:38:07,413 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_d64cda5f-b449-499c-abc1-5cd796bc5494/bin-2019/uautomizer/../../sv-benchmarks/c/forester-heap/dll-rb-sentinel_false-unreach-call_false-valid-memtrack.i [2018-11-10 00:38:07,452 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d64cda5f-b449-499c-abc1-5cd796bc5494/bin-2019/uautomizer/data/a388462d5/2a0c13e403124ae999202285cb3bd09f/FLAGd6f2fe2e8 [2018-11-10 00:38:07,827 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 00:38:07,827 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_d64cda5f-b449-499c-abc1-5cd796bc5494/sv-benchmarks/c/forester-heap/dll-rb-sentinel_false-unreach-call_false-valid-memtrack.i [2018-11-10 00:38:07,835 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d64cda5f-b449-499c-abc1-5cd796bc5494/bin-2019/uautomizer/data/a388462d5/2a0c13e403124ae999202285cb3bd09f/FLAGd6f2fe2e8 [2018-11-10 00:38:07,844 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_d64cda5f-b449-499c-abc1-5cd796bc5494/bin-2019/uautomizer/data/a388462d5/2a0c13e403124ae999202285cb3bd09f [2018-11-10 00:38:07,846 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 00:38:07,847 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-10 00:38:07,848 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 00:38:07,848 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 00:38:07,851 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 00:38:07,852 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:38:07" (1/1) ... [2018-11-10 00:38:07,854 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ff31fb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:38:07, skipping insertion in model container [2018-11-10 00:38:07,855 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:38:07" (1/1) ... [2018-11-10 00:38:07,862 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 00:38:07,891 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 00:38:08,080 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 00:38:08,086 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 00:38:08,116 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 00:38:08,142 INFO L193 MainTranslator]: Completed translation [2018-11-10 00:38:08,143 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:38:08 WrapperNode [2018-11-10 00:38:08,143 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 00:38:08,143 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 00:38:08,143 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 00:38:08,143 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 00:38:08,190 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:38:08" (1/1) ... [2018-11-10 00:38:08,190 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:38:08" (1/1) ... [2018-11-10 00:38:08,199 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:38:08" (1/1) ... [2018-11-10 00:38:08,199 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:38:08" (1/1) ... [2018-11-10 00:38:08,209 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:38:08" (1/1) ... [2018-11-10 00:38:08,213 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:38:08" (1/1) ... [2018-11-10 00:38:08,215 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:38:08" (1/1) ... [2018-11-10 00:38:08,219 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 00:38:08,220 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 00:38:08,220 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 00:38:08,220 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 00:38:08,221 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:38:08" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d64cda5f-b449-499c-abc1-5cd796bc5494/bin-2019/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 [2018-11-10 00:38:08,258 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 00:38:08,258 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 00:38:08,258 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 00:38:08,258 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-10 00:38:08,258 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-10 00:38:08,258 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-10 00:38:08,258 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-10 00:38:08,258 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-10 00:38:08,258 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-10 00:38:08,258 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-10 00:38:08,258 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-10 00:38:08,259 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-10 00:38:08,259 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-10 00:38:08,259 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-10 00:38:08,259 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-10 00:38:08,259 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-10 00:38:08,259 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-10 00:38:08,259 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-10 00:38:08,259 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-10 00:38:08,260 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-10 00:38:08,260 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-10 00:38:08,260 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-10 00:38:08,260 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-10 00:38:08,260 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-10 00:38:08,260 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-10 00:38:08,260 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-10 00:38:08,260 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-10 00:38:08,261 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-10 00:38:08,261 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-10 00:38:08,261 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-10 00:38:08,261 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-10 00:38:08,261 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-10 00:38:08,261 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-10 00:38:08,261 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-10 00:38:08,261 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-10 00:38:08,261 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-10 00:38:08,261 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-10 00:38:08,261 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-10 00:38:08,261 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-10 00:38:08,261 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-10 00:38:08,262 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-10 00:38:08,262 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-10 00:38:08,262 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-10 00:38:08,262 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-10 00:38:08,262 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-10 00:38:08,262 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-10 00:38:08,262 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-10 00:38:08,262 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-10 00:38:08,262 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-10 00:38:08,262 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-10 00:38:08,262 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-10 00:38:08,262 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-10 00:38:08,262 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-10 00:38:08,262 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-10 00:38:08,262 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-10 00:38:08,263 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-10 00:38:08,263 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-10 00:38:08,263 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-10 00:38:08,263 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-10 00:38:08,263 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-10 00:38:08,263 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-10 00:38:08,263 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-11-10 00:38:08,263 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-10 00:38:08,263 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-10 00:38:08,263 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-11-10 00:38:08,263 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-10 00:38:08,263 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-10 00:38:08,264 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2018-11-10 00:38:08,264 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-10 00:38:08,264 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-10 00:38:08,264 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-10 00:38:08,264 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-10 00:38:08,264 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-10 00:38:08,264 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-10 00:38:08,264 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-10 00:38:08,264 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-10 00:38:08,264 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-10 00:38:08,265 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-10 00:38:08,265 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-10 00:38:08,265 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-10 00:38:08,265 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-10 00:38:08,265 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-10 00:38:08,265 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-10 00:38:08,265 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-10 00:38:08,265 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-10 00:38:08,265 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-10 00:38:08,266 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-10 00:38:08,266 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-10 00:38:08,266 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-10 00:38:08,266 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-10 00:38:08,266 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-10 00:38:08,266 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-10 00:38:08,266 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-10 00:38:08,266 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-10 00:38:08,266 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-10 00:38:08,267 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-10 00:38:08,267 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-10 00:38:08,267 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-10 00:38:08,267 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-10 00:38:08,267 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-10 00:38:08,267 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-10 00:38:08,267 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-10 00:38:08,267 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-10 00:38:08,267 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-10 00:38:08,268 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-10 00:38:08,268 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-10 00:38:08,268 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-10 00:38:08,268 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-10 00:38:08,268 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 00:38:08,268 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-10 00:38:08,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-10 00:38:08,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 00:38:08,268 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-10 00:38:08,268 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 00:38:08,269 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-10 00:38:08,269 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 00:38:08,269 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 00:38:08,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-10 00:38:08,743 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 00:38:08,743 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:38:08 BoogieIcfgContainer [2018-11-10 00:38:08,744 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 00:38:08,744 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 00:38:08,744 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 00:38:08,747 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 00:38:08,747 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 12:38:07" (1/3) ... [2018-11-10 00:38:08,748 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c0f19a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:38:08, skipping insertion in model container [2018-11-10 00:38:08,748 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:38:08" (2/3) ... [2018-11-10 00:38:08,748 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c0f19a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:38:08, skipping insertion in model container [2018-11-10 00:38:08,749 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:38:08" (3/3) ... [2018-11-10 00:38:08,750 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-rb-sentinel_false-unreach-call_false-valid-memtrack.i [2018-11-10 00:38:08,758 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 00:38:08,767 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 67 error locations. [2018-11-10 00:38:08,778 INFO L257 AbstractCegarLoop]: Starting to check reachability of 67 error locations. [2018-11-10 00:38:08,795 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 00:38:08,795 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 00:38:08,795 INFO L383 AbstractCegarLoop]: Hoare is false [2018-11-10 00:38:08,795 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 00:38:08,795 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 00:38:08,795 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 00:38:08,796 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 00:38:08,796 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 00:38:08,796 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 00:38:08,807 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states. [2018-11-10 00:38:08,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-11-10 00:38:08,813 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 00:38:08,814 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 00:38:08,815 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr45REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr47REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION]=== [2018-11-10 00:38:08,818 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:38:08,819 INFO L82 PathProgramCache]: Analyzing trace with hash 174214734, now seen corresponding path program 1 times [2018-11-10 00:38:08,820 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:38:08,821 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:38:08,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:38:08,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:38:08,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:38:08,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:38:08,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:38:08,930 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 00:38:08,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 00:38:08,932 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 00:38:08,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 00:38:08,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 00:38:08,942 INFO L87 Difference]: Start difference. First operand 166 states. Second operand 4 states. [2018-11-10 00:38:09,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 00:38:09,184 INFO L93 Difference]: Finished difference Result 191 states and 198 transitions. [2018-11-10 00:38:09,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 00:38:09,185 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-11-10 00:38:09,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 00:38:09,193 INFO L225 Difference]: With dead ends: 191 [2018-11-10 00:38:09,193 INFO L226 Difference]: Without dead ends: 187 [2018-11-10 00:38:09,194 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 00:38:09,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-11-10 00:38:09,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 160. [2018-11-10 00:38:09,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-11-10 00:38:09,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 165 transitions. [2018-11-10 00:38:09,227 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 165 transitions. Word has length 8 [2018-11-10 00:38:09,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 00:38:09,227 INFO L481 AbstractCegarLoop]: Abstraction has 160 states and 165 transitions. [2018-11-10 00:38:09,228 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 00:38:09,228 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 165 transitions. [2018-11-10 00:38:09,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-11-10 00:38:09,228 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 00:38:09,228 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 00:38:09,229 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr45REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr47REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION]=== [2018-11-10 00:38:09,229 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:38:09,229 INFO L82 PathProgramCache]: Analyzing trace with hash 174214735, now seen corresponding path program 1 times [2018-11-10 00:38:09,229 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:38:09,229 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:38:09,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:38:09,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:38:09,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:38:09,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:38:09,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:38:09,275 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 00:38:09,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 00:38:09,277 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 00:38:09,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 00:38:09,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 00:38:09,277 INFO L87 Difference]: Start difference. First operand 160 states and 165 transitions. Second operand 4 states. [2018-11-10 00:38:09,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 00:38:09,412 INFO L93 Difference]: Finished difference Result 157 states and 162 transitions. [2018-11-10 00:38:09,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 00:38:09,412 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-11-10 00:38:09,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 00:38:09,413 INFO L225 Difference]: With dead ends: 157 [2018-11-10 00:38:09,413 INFO L226 Difference]: Without dead ends: 157 [2018-11-10 00:38:09,414 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 00:38:09,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-11-10 00:38:09,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2018-11-10 00:38:09,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-11-10 00:38:09,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 162 transitions. [2018-11-10 00:38:09,420 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 162 transitions. Word has length 8 [2018-11-10 00:38:09,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 00:38:09,420 INFO L481 AbstractCegarLoop]: Abstraction has 157 states and 162 transitions. [2018-11-10 00:38:09,420 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 00:38:09,420 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 162 transitions. [2018-11-10 00:38:09,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-10 00:38:09,421 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 00:38:09,421 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 00:38:09,421 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr45REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr47REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION]=== [2018-11-10 00:38:09,421 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:38:09,421 INFO L82 PathProgramCache]: Analyzing trace with hash -1062536033, now seen corresponding path program 1 times [2018-11-10 00:38:09,422 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:38:09,422 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:38:09,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:38:09,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:38:09,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:38:09,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:38:09,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:38:09,460 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 00:38:09,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 00:38:09,460 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 00:38:09,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 00:38:09,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 00:38:09,461 INFO L87 Difference]: Start difference. First operand 157 states and 162 transitions. Second operand 4 states. [2018-11-10 00:38:09,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 00:38:09,577 INFO L93 Difference]: Finished difference Result 172 states and 178 transitions. [2018-11-10 00:38:09,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 00:38:09,578 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-11-10 00:38:09,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 00:38:09,579 INFO L225 Difference]: With dead ends: 172 [2018-11-10 00:38:09,579 INFO L226 Difference]: Without dead ends: 172 [2018-11-10 00:38:09,579 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 00:38:09,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-11-10 00:38:09,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 153. [2018-11-10 00:38:09,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-11-10 00:38:09,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 160 transitions. [2018-11-10 00:38:09,587 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 160 transitions. Word has length 13 [2018-11-10 00:38:09,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 00:38:09,588 INFO L481 AbstractCegarLoop]: Abstraction has 153 states and 160 transitions. [2018-11-10 00:38:09,588 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 00:38:09,588 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 160 transitions. [2018-11-10 00:38:09,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-10 00:38:09,588 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 00:38:09,589 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 00:38:09,589 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr45REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr47REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION]=== [2018-11-10 00:38:09,589 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:38:09,589 INFO L82 PathProgramCache]: Analyzing trace with hash -1062536032, now seen corresponding path program 1 times [2018-11-10 00:38:09,589 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:38:09,590 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:38:09,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:38:09,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:38:09,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:38:09,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:38:09,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:38:09,629 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 00:38:09,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 00:38:09,630 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 00:38:09,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 00:38:09,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 00:38:09,631 INFO L87 Difference]: Start difference. First operand 153 states and 160 transitions. Second operand 4 states. [2018-11-10 00:38:09,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 00:38:09,717 INFO L93 Difference]: Finished difference Result 169 states and 175 transitions. [2018-11-10 00:38:09,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 00:38:09,717 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-11-10 00:38:09,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 00:38:09,718 INFO L225 Difference]: With dead ends: 169 [2018-11-10 00:38:09,718 INFO L226 Difference]: Without dead ends: 169 [2018-11-10 00:38:09,719 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 00:38:09,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-11-10 00:38:09,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 157. [2018-11-10 00:38:09,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-11-10 00:38:09,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 164 transitions. [2018-11-10 00:38:09,723 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 164 transitions. Word has length 13 [2018-11-10 00:38:09,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 00:38:09,723 INFO L481 AbstractCegarLoop]: Abstraction has 157 states and 164 transitions. [2018-11-10 00:38:09,724 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 00:38:09,724 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 164 transitions. [2018-11-10 00:38:09,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-10 00:38:09,724 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 00:38:09,724 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 00:38:09,724 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr45REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr47REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION]=== [2018-11-10 00:38:09,724 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:38:09,724 INFO L82 PathProgramCache]: Analyzing trace with hash 628133548, now seen corresponding path program 1 times [2018-11-10 00:38:09,725 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:38:09,725 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:38:09,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:38:09,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:38:09,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:38:09,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:38:09,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:38:09,776 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 00:38:09,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 00:38:09,777 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 00:38:09,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 00:38:09,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 00:38:09,777 INFO L87 Difference]: Start difference. First operand 157 states and 164 transitions. Second operand 4 states. [2018-11-10 00:38:09,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 00:38:09,898 INFO L93 Difference]: Finished difference Result 160 states and 168 transitions. [2018-11-10 00:38:09,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 00:38:09,898 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-11-10 00:38:09,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 00:38:09,899 INFO L225 Difference]: With dead ends: 160 [2018-11-10 00:38:09,899 INFO L226 Difference]: Without dead ends: 160 [2018-11-10 00:38:09,899 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 00:38:09,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-11-10 00:38:09,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 145. [2018-11-10 00:38:09,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-11-10 00:38:09,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 154 transitions. [2018-11-10 00:38:09,904 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 154 transitions. Word has length 21 [2018-11-10 00:38:09,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 00:38:09,905 INFO L481 AbstractCegarLoop]: Abstraction has 145 states and 154 transitions. [2018-11-10 00:38:09,905 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 00:38:09,905 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 154 transitions. [2018-11-10 00:38:09,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-10 00:38:09,905 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 00:38:09,905 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 00:38:09,906 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr45REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr47REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION]=== [2018-11-10 00:38:09,906 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:38:09,906 INFO L82 PathProgramCache]: Analyzing trace with hash 628133549, now seen corresponding path program 1 times [2018-11-10 00:38:09,906 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:38:09,907 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:38:09,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:38:09,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:38:09,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:38:09,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:38:09,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:38:09,972 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 00:38:09,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 00:38:09,973 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 00:38:09,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 00:38:09,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 00:38:09,973 INFO L87 Difference]: Start difference. First operand 145 states and 154 transitions. Second operand 5 states. [2018-11-10 00:38:10,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 00:38:10,119 INFO L93 Difference]: Finished difference Result 185 states and 195 transitions. [2018-11-10 00:38:10,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 00:38:10,119 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-11-10 00:38:10,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 00:38:10,120 INFO L225 Difference]: With dead ends: 185 [2018-11-10 00:38:10,120 INFO L226 Difference]: Without dead ends: 185 [2018-11-10 00:38:10,120 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-10 00:38:10,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-11-10 00:38:10,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 156. [2018-11-10 00:38:10,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-11-10 00:38:10,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 168 transitions. [2018-11-10 00:38:10,125 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 168 transitions. Word has length 21 [2018-11-10 00:38:10,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 00:38:10,126 INFO L481 AbstractCegarLoop]: Abstraction has 156 states and 168 transitions. [2018-11-10 00:38:10,126 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 00:38:10,126 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 168 transitions. [2018-11-10 00:38:10,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-10 00:38:10,127 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 00:38:10,127 INFO L375 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] [2018-11-10 00:38:10,127 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mainErr45REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr47REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION]=== [2018-11-10 00:38:10,127 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:38:10,127 INFO L82 PathProgramCache]: Analyzing trace with hash -1954048785, now seen corresponding path program 1 times [2018-11-10 00:38:10,128 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:38:10,128 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:38:10,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:38:10,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:38:10,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:38:10,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:38:10,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:38:10,182 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 00:38:10,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 00:38:10,182 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 00:38:10,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 00:38:10,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 00:38:10,184 INFO L87 Difference]: Start difference. First operand 156 states and 168 transitions. Second operand 5 states. [2018-11-10 00:38:10,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 00:38:10,355 INFO L93 Difference]: Finished difference Result 207 states and 223 transitions. [2018-11-10 00:38:10,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 00:38:10,355 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-11-10 00:38:10,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 00:38:10,356 INFO L225 Difference]: With dead ends: 207 [2018-11-10 00:38:10,356 INFO L226 Difference]: Without dead ends: 207 [2018-11-10 00:38:10,356 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-10 00:38:10,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-11-10 00:38:10,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 155. [2018-11-10 00:38:10,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-11-10 00:38:10,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 166 transitions. [2018-11-10 00:38:10,361 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 166 transitions. Word has length 23 [2018-11-10 00:38:10,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 00:38:10,361 INFO L481 AbstractCegarLoop]: Abstraction has 155 states and 166 transitions. [2018-11-10 00:38:10,362 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 00:38:10,362 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 166 transitions. [2018-11-10 00:38:10,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-10 00:38:10,362 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 00:38:10,362 INFO L375 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] [2018-11-10 00:38:10,363 INFO L424 AbstractCegarLoop]: === Iteration 8 === [mainErr45REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr47REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION]=== [2018-11-10 00:38:10,363 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:38:10,363 INFO L82 PathProgramCache]: Analyzing trace with hash -1954048784, now seen corresponding path program 1 times [2018-11-10 00:38:10,363 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:38:10,363 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:38:10,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:38:10,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:38:10,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:38:10,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:38:10,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:38:10,423 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 00:38:10,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 00:38:10,424 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 00:38:10,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 00:38:10,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 00:38:10,424 INFO L87 Difference]: Start difference. First operand 155 states and 166 transitions. Second operand 5 states. [2018-11-10 00:38:10,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 00:38:10,613 INFO L93 Difference]: Finished difference Result 231 states and 248 transitions. [2018-11-10 00:38:10,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 00:38:10,613 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-11-10 00:38:10,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 00:38:10,614 INFO L225 Difference]: With dead ends: 231 [2018-11-10 00:38:10,614 INFO L226 Difference]: Without dead ends: 231 [2018-11-10 00:38:10,614 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-10 00:38:10,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2018-11-10 00:38:10,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 154. [2018-11-10 00:38:10,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-11-10 00:38:10,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 164 transitions. [2018-11-10 00:38:10,617 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 164 transitions. Word has length 23 [2018-11-10 00:38:10,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 00:38:10,617 INFO L481 AbstractCegarLoop]: Abstraction has 154 states and 164 transitions. [2018-11-10 00:38:10,618 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 00:38:10,618 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 164 transitions. [2018-11-10 00:38:10,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-10 00:38:10,618 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 00:38:10,618 INFO L375 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] [2018-11-10 00:38:10,619 INFO L424 AbstractCegarLoop]: === Iteration 9 === [mainErr45REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr47REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION]=== [2018-11-10 00:38:10,619 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:38:10,619 INFO L82 PathProgramCache]: Analyzing trace with hash -1563619919, now seen corresponding path program 1 times [2018-11-10 00:38:10,619 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:38:10,619 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:38:10,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:38:10,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:38:10,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:38:10,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:38:10,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:38:10,712 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 00:38:10,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-10 00:38:10,713 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 00:38:10,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 00:38:10,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-10 00:38:10,713 INFO L87 Difference]: Start difference. First operand 154 states and 164 transitions. Second operand 9 states. [2018-11-10 00:38:10,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 00:38:10,931 INFO L93 Difference]: Finished difference Result 167 states and 177 transitions. [2018-11-10 00:38:10,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 00:38:10,932 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 27 [2018-11-10 00:38:10,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 00:38:10,933 INFO L225 Difference]: With dead ends: 167 [2018-11-10 00:38:10,933 INFO L226 Difference]: Without dead ends: 167 [2018-11-10 00:38:10,933 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2018-11-10 00:38:10,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-11-10 00:38:10,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 153. [2018-11-10 00:38:10,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-11-10 00:38:10,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 163 transitions. [2018-11-10 00:38:10,936 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 163 transitions. Word has length 27 [2018-11-10 00:38:10,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 00:38:10,936 INFO L481 AbstractCegarLoop]: Abstraction has 153 states and 163 transitions. [2018-11-10 00:38:10,936 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 00:38:10,936 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 163 transitions. [2018-11-10 00:38:10,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-10 00:38:10,936 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 00:38:10,937 INFO L375 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] [2018-11-10 00:38:10,937 INFO L424 AbstractCegarLoop]: === Iteration 10 === [mainErr45REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr47REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION]=== [2018-11-10 00:38:10,937 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:38:10,937 INFO L82 PathProgramCache]: Analyzing trace with hash -1563619918, now seen corresponding path program 1 times [2018-11-10 00:38:10,937 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:38:10,937 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:38:10,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:38:10,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:38:10,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:38:10,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:38:11,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:38:11,038 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 00:38:11,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-10 00:38:11,038 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-10 00:38:11,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 00:38:11,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-11-10 00:38:11,039 INFO L87 Difference]: Start difference. First operand 153 states and 163 transitions. Second operand 10 states. [2018-11-10 00:38:11,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 00:38:11,604 INFO L93 Difference]: Finished difference Result 183 states and 194 transitions. [2018-11-10 00:38:11,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-10 00:38:11,604 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 27 [2018-11-10 00:38:11,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 00:38:11,604 INFO L225 Difference]: With dead ends: 183 [2018-11-10 00:38:11,605 INFO L226 Difference]: Without dead ends: 183 [2018-11-10 00:38:11,605 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=291, Unknown=0, NotChecked=0, Total=420 [2018-11-10 00:38:11,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-11-10 00:38:11,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 158. [2018-11-10 00:38:11,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-11-10 00:38:11,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 168 transitions. [2018-11-10 00:38:11,607 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 168 transitions. Word has length 27 [2018-11-10 00:38:11,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 00:38:11,607 INFO L481 AbstractCegarLoop]: Abstraction has 158 states and 168 transitions. [2018-11-10 00:38:11,607 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-10 00:38:11,607 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 168 transitions. [2018-11-10 00:38:11,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-10 00:38:11,608 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 00:38:11,608 INFO L375 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] [2018-11-10 00:38:11,608 INFO L424 AbstractCegarLoop]: === Iteration 11 === [mainErr45REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr47REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION]=== [2018-11-10 00:38:11,608 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:38:11,608 INFO L82 PathProgramCache]: Analyzing trace with hash 1535529887, now seen corresponding path program 1 times [2018-11-10 00:38:11,608 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:38:11,608 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:38:11,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:38:11,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:38:11,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:38:11,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:38:11,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:38:11,652 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 00:38:11,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-10 00:38:11,652 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 00:38:11,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 00:38:11,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-10 00:38:11,653 INFO L87 Difference]: Start difference. First operand 158 states and 168 transitions. Second operand 8 states. [2018-11-10 00:38:11,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 00:38:11,834 INFO L93 Difference]: Finished difference Result 186 states and 197 transitions. [2018-11-10 00:38:11,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 00:38:11,835 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2018-11-10 00:38:11,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 00:38:11,836 INFO L225 Difference]: With dead ends: 186 [2018-11-10 00:38:11,836 INFO L226 Difference]: Without dead ends: 186 [2018-11-10 00:38:11,836 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2018-11-10 00:38:11,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-11-10 00:38:11,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 158. [2018-11-10 00:38:11,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-11-10 00:38:11,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 167 transitions. [2018-11-10 00:38:11,839 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 167 transitions. Word has length 33 [2018-11-10 00:38:11,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 00:38:11,839 INFO L481 AbstractCegarLoop]: Abstraction has 158 states and 167 transitions. [2018-11-10 00:38:11,839 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 00:38:11,839 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 167 transitions. [2018-11-10 00:38:11,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-10 00:38:11,840 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 00:38:11,840 INFO L375 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] [2018-11-10 00:38:11,840 INFO L424 AbstractCegarLoop]: === Iteration 12 === [mainErr45REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr47REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION]=== [2018-11-10 00:38:11,840 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:38:11,840 INFO L82 PathProgramCache]: Analyzing trace with hash 2090659852, now seen corresponding path program 1 times [2018-11-10 00:38:11,840 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:38:11,840 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:38:11,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:38:11,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:38:11,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:38:11,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:38:11,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:38:11,869 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 00:38:11,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 00:38:11,870 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 00:38:11,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 00:38:11,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 00:38:11,870 INFO L87 Difference]: Start difference. First operand 158 states and 167 transitions. Second operand 5 states. [2018-11-10 00:38:12,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 00:38:12,026 INFO L93 Difference]: Finished difference Result 236 states and 251 transitions. [2018-11-10 00:38:12,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 00:38:12,027 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2018-11-10 00:38:12,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 00:38:12,028 INFO L225 Difference]: With dead ends: 236 [2018-11-10 00:38:12,028 INFO L226 Difference]: Without dead ends: 236 [2018-11-10 00:38:12,028 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-10 00:38:12,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2018-11-10 00:38:12,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 157. [2018-11-10 00:38:12,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-11-10 00:38:12,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 166 transitions. [2018-11-10 00:38:12,031 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 166 transitions. Word has length 34 [2018-11-10 00:38:12,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 00:38:12,032 INFO L481 AbstractCegarLoop]: Abstraction has 157 states and 166 transitions. [2018-11-10 00:38:12,032 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 00:38:12,032 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 166 transitions. [2018-11-10 00:38:12,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-10 00:38:12,032 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 00:38:12,033 INFO L375 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] [2018-11-10 00:38:12,033 INFO L424 AbstractCegarLoop]: === Iteration 13 === [mainErr45REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr47REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION]=== [2018-11-10 00:38:12,033 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:38:12,033 INFO L82 PathProgramCache]: Analyzing trace with hash 2090659853, now seen corresponding path program 1 times [2018-11-10 00:38:12,033 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:38:12,033 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:38:12,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:38:12,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:38:12,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:38:12,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:38:12,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:38:12,090 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 00:38:12,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 00:38:12,090 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 00:38:12,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 00:38:12,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 00:38:12,091 INFO L87 Difference]: Start difference. First operand 157 states and 166 transitions. Second operand 5 states. [2018-11-10 00:38:12,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 00:38:12,302 INFO L93 Difference]: Finished difference Result 260 states and 277 transitions. [2018-11-10 00:38:12,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 00:38:12,302 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2018-11-10 00:38:12,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 00:38:12,303 INFO L225 Difference]: With dead ends: 260 [2018-11-10 00:38:12,303 INFO L226 Difference]: Without dead ends: 260 [2018-11-10 00:38:12,303 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-10 00:38:12,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2018-11-10 00:38:12,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 156. [2018-11-10 00:38:12,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-11-10 00:38:12,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 165 transitions. [2018-11-10 00:38:12,307 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 165 transitions. Word has length 34 [2018-11-10 00:38:12,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 00:38:12,307 INFO L481 AbstractCegarLoop]: Abstraction has 156 states and 165 transitions. [2018-11-10 00:38:12,307 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 00:38:12,307 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 165 transitions. [2018-11-10 00:38:12,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-10 00:38:12,308 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 00:38:12,308 INFO L375 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] [2018-11-10 00:38:12,311 INFO L424 AbstractCegarLoop]: === Iteration 14 === [mainErr45REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr47REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION]=== [2018-11-10 00:38:12,311 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:38:12,311 INFO L82 PathProgramCache]: Analyzing trace with hash 566596208, now seen corresponding path program 1 times [2018-11-10 00:38:12,312 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:38:12,312 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:38:12,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:38:12,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:38:12,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:38:12,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:38:12,406 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:38:12,406 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 00:38:12,406 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d64cda5f-b449-499c-abc1-5cd796bc5494/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 00:38:12,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:38:12,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:38:12,456 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 00:38:12,496 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 00:38:12,502 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 00:38:12,502 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 00:38:12,504 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 00:38:12,516 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 00:38:12,518 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 00:38:12,519 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 00:38:12,522 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 00:38:12,527 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 00:38:12,528 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:23, output treesize:15 [2018-11-10 00:38:12,534 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-11-10 00:38:12,537 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 00:38:12,538 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-11-10 00:38:12,538 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 00:38:12,542 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 00:38:12,554 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-11-10 00:38:12,556 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 00:38:12,557 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-11-10 00:38:12,557 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 00:38:12,561 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 00:38:12,569 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 00:38:12,569 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:41, output treesize:33 [2018-11-10 00:38:12,601 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-11-10 00:38:12,604 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 00:38:12,605 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-10 00:38:12,606 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 00:38:12,611 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 00:38:12,616 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-11-10 00:38:12,618 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 00:38:12,618 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-10 00:38:12,619 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 00:38:12,621 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 00:38:12,626 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 00:38:12,627 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:47, output treesize:7 [2018-11-10 00:38:12,639 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:38:12,665 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 00:38:12,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 8 [2018-11-10 00:38:12,665 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 00:38:12,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 00:38:12,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-10 00:38:12,665 INFO L87 Difference]: Start difference. First operand 156 states and 165 transitions. Second operand 8 states. [2018-11-10 00:38:12,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 00:38:12,895 INFO L93 Difference]: Finished difference Result 225 states and 238 transitions. [2018-11-10 00:38:12,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-10 00:38:12,896 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 36 [2018-11-10 00:38:12,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 00:38:12,897 INFO L225 Difference]: With dead ends: 225 [2018-11-10 00:38:12,897 INFO L226 Difference]: Without dead ends: 225 [2018-11-10 00:38:12,897 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2018-11-10 00:38:12,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-11-10 00:38:12,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 175. [2018-11-10 00:38:12,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-11-10 00:38:12,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 186 transitions. [2018-11-10 00:38:12,901 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 186 transitions. Word has length 36 [2018-11-10 00:38:12,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 00:38:12,901 INFO L481 AbstractCegarLoop]: Abstraction has 175 states and 186 transitions. [2018-11-10 00:38:12,901 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 00:38:12,902 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 186 transitions. [2018-11-10 00:38:12,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-10 00:38:12,902 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 00:38:12,902 INFO L375 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] [2018-11-10 00:38:12,903 INFO L424 AbstractCegarLoop]: === Iteration 15 === [mainErr45REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr47REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION]=== [2018-11-10 00:38:12,903 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:38:12,903 INFO L82 PathProgramCache]: Analyzing trace with hash 1406625268, now seen corresponding path program 1 times [2018-11-10 00:38:12,903 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:38:12,903 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:38:12,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:38:12,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:38:12,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:38:12,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:38:12,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:38:12,986 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 00:38:12,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 00:38:12,986 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 00:38:12,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 00:38:12,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 00:38:12,986 INFO L87 Difference]: Start difference. First operand 175 states and 186 transitions. Second operand 5 states. [2018-11-10 00:38:13,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 00:38:13,071 INFO L93 Difference]: Finished difference Result 182 states and 191 transitions. [2018-11-10 00:38:13,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 00:38:13,072 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2018-11-10 00:38:13,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 00:38:13,072 INFO L225 Difference]: With dead ends: 182 [2018-11-10 00:38:13,072 INFO L226 Difference]: Without dead ends: 182 [2018-11-10 00:38:13,073 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-10 00:38:13,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-11-10 00:38:13,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 174. [2018-11-10 00:38:13,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-11-10 00:38:13,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 183 transitions. [2018-11-10 00:38:13,076 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 183 transitions. Word has length 38 [2018-11-10 00:38:13,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 00:38:13,076 INFO L481 AbstractCegarLoop]: Abstraction has 174 states and 183 transitions. [2018-11-10 00:38:13,076 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 00:38:13,076 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 183 transitions. [2018-11-10 00:38:13,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-10 00:38:13,077 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 00:38:13,077 INFO L375 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] [2018-11-10 00:38:13,077 INFO L424 AbstractCegarLoop]: === Iteration 16 === [mainErr45REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr47REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION]=== [2018-11-10 00:38:13,077 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:38:13,077 INFO L82 PathProgramCache]: Analyzing trace with hash 90417614, now seen corresponding path program 1 times [2018-11-10 00:38:13,077 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:38:13,077 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:38:13,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:38:13,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:38:13,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:38:13,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:38:13,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:38:13,151 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 00:38:13,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 00:38:13,151 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 00:38:13,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 00:38:13,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-10 00:38:13,152 INFO L87 Difference]: Start difference. First operand 174 states and 183 transitions. Second operand 8 states. [2018-11-10 00:38:13,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 00:38:13,412 INFO L93 Difference]: Finished difference Result 175 states and 184 transitions. [2018-11-10 00:38:13,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 00:38:13,412 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 38 [2018-11-10 00:38:13,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 00:38:13,413 INFO L225 Difference]: With dead ends: 175 [2018-11-10 00:38:13,413 INFO L226 Difference]: Without dead ends: 175 [2018-11-10 00:38:13,413 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2018-11-10 00:38:13,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-11-10 00:38:13,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 173. [2018-11-10 00:38:13,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-11-10 00:38:13,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 182 transitions. [2018-11-10 00:38:13,416 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 182 transitions. Word has length 38 [2018-11-10 00:38:13,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 00:38:13,417 INFO L481 AbstractCegarLoop]: Abstraction has 173 states and 182 transitions. [2018-11-10 00:38:13,417 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 00:38:13,417 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 182 transitions. [2018-11-10 00:38:13,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-10 00:38:13,417 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 00:38:13,417 INFO L375 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] [2018-11-10 00:38:13,418 INFO L424 AbstractCegarLoop]: === Iteration 17 === [mainErr45REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr47REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION]=== [2018-11-10 00:38:13,418 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:38:13,418 INFO L82 PathProgramCache]: Analyzing trace with hash 90417615, now seen corresponding path program 1 times [2018-11-10 00:38:13,418 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:38:13,418 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:38:13,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:38:13,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:38:13,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:38:13,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:38:13,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:38:13,500 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 00:38:13,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-10 00:38:13,500 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 00:38:13,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 00:38:13,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-10 00:38:13,500 INFO L87 Difference]: Start difference. First operand 173 states and 182 transitions. Second operand 9 states. [2018-11-10 00:38:13,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 00:38:13,686 INFO L93 Difference]: Finished difference Result 170 states and 179 transitions. [2018-11-10 00:38:13,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 00:38:13,686 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 38 [2018-11-10 00:38:13,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 00:38:13,687 INFO L225 Difference]: With dead ends: 170 [2018-11-10 00:38:13,687 INFO L226 Difference]: Without dead ends: 170 [2018-11-10 00:38:13,687 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2018-11-10 00:38:13,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-11-10 00:38:13,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 146. [2018-11-10 00:38:13,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-11-10 00:38:13,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 154 transitions. [2018-11-10 00:38:13,690 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 154 transitions. Word has length 38 [2018-11-10 00:38:13,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 00:38:13,690 INFO L481 AbstractCegarLoop]: Abstraction has 146 states and 154 transitions. [2018-11-10 00:38:13,690 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 00:38:13,690 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 154 transitions. [2018-11-10 00:38:13,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-10 00:38:13,690 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 00:38:13,690 INFO L375 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] [2018-11-10 00:38:13,691 INFO L424 AbstractCegarLoop]: === Iteration 18 === [mainErr45REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr47REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION]=== [2018-11-10 00:38:13,691 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:38:13,691 INFO L82 PathProgramCache]: Analyzing trace with hash 246329433, now seen corresponding path program 1 times [2018-11-10 00:38:13,691 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:38:13,691 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:38:13,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:38:13,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:38:13,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:38:13,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:38:13,742 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 00:38:13,743 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 00:38:13,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-10 00:38:13,743 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 00:38:13,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 00:38:13,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-10 00:38:13,743 INFO L87 Difference]: Start difference. First operand 146 states and 154 transitions. Second operand 8 states. [2018-11-10 00:38:13,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 00:38:13,875 INFO L93 Difference]: Finished difference Result 163 states and 170 transitions. [2018-11-10 00:38:13,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 00:38:13,876 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 39 [2018-11-10 00:38:13,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 00:38:13,876 INFO L225 Difference]: With dead ends: 163 [2018-11-10 00:38:13,877 INFO L226 Difference]: Without dead ends: 163 [2018-11-10 00:38:13,877 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2018-11-10 00:38:13,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-11-10 00:38:13,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 146. [2018-11-10 00:38:13,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-11-10 00:38:13,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 153 transitions. [2018-11-10 00:38:13,880 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 153 transitions. Word has length 39 [2018-11-10 00:38:13,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 00:38:13,880 INFO L481 AbstractCegarLoop]: Abstraction has 146 states and 153 transitions. [2018-11-10 00:38:13,880 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 00:38:13,880 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 153 transitions. [2018-11-10 00:38:13,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-10 00:38:13,880 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 00:38:13,881 INFO L375 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, 1] [2018-11-10 00:38:13,881 INFO L424 AbstractCegarLoop]: === Iteration 19 === [mainErr45REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr47REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION]=== [2018-11-10 00:38:13,881 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:38:13,881 INFO L82 PathProgramCache]: Analyzing trace with hash -1551243035, now seen corresponding path program 1 times [2018-11-10 00:38:13,883 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:38:13,883 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:38:13,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:38:13,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:38:13,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:38:13,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:38:13,936 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:38:13,936 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 00:38:13,936 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d64cda5f-b449-499c-abc1-5cd796bc5494/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 00:38:13,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:38:13,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:38:13,975 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 00:38:13,990 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 00:38:13,992 INFO L477 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 10 treesize of output 9 [2018-11-10 00:38:13,992 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 00:38:13,994 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 00:38:13,995 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 00:38:13,996 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 00:38:14,002 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 00:38:14,006 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 00:38:14,006 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 00:38:14,007 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 00:38:14,009 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 00:38:14,009 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 00:38:14,016 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 00:38:14,033 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 00:38:14,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 9 [2018-11-10 00:38:14,033 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 00:38:14,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 00:38:14,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-10 00:38:14,034 INFO L87 Difference]: Start difference. First operand 146 states and 153 transitions. Second operand 9 states. [2018-11-10 00:38:14,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 00:38:14,249 INFO L93 Difference]: Finished difference Result 233 states and 244 transitions. [2018-11-10 00:38:14,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-10 00:38:14,250 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 45 [2018-11-10 00:38:14,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 00:38:14,250 INFO L225 Difference]: With dead ends: 233 [2018-11-10 00:38:14,250 INFO L226 Difference]: Without dead ends: 233 [2018-11-10 00:38:14,251 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2018-11-10 00:38:14,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-11-10 00:38:14,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 143. [2018-11-10 00:38:14,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-11-10 00:38:14,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 149 transitions. [2018-11-10 00:38:14,253 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 149 transitions. Word has length 45 [2018-11-10 00:38:14,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 00:38:14,254 INFO L481 AbstractCegarLoop]: Abstraction has 143 states and 149 transitions. [2018-11-10 00:38:14,254 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 00:38:14,254 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 149 transitions. [2018-11-10 00:38:14,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-10 00:38:14,254 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 00:38:14,254 INFO L375 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, 1, 1, 1, 1, 1, 1] [2018-11-10 00:38:14,255 INFO L424 AbstractCegarLoop]: === Iteration 20 === [mainErr45REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr47REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION]=== [2018-11-10 00:38:14,255 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:38:14,255 INFO L82 PathProgramCache]: Analyzing trace with hash 1000742218, now seen corresponding path program 1 times [2018-11-10 00:38:14,255 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:38:14,255 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:38:14,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:38:14,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:38:14,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:38:14,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:38:14,325 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:38:14,325 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 00:38:14,325 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d64cda5f-b449-499c-abc1-5cd796bc5494/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 00:38:14,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:38:14,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:38:14,365 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 00:38:14,398 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 00:38:14,400 INFO L477 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 10 treesize of output 9 [2018-11-10 00:38:14,400 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 00:38:14,402 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 00:38:14,405 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 00:38:14,406 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 00:38:14,477 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-10 00:38:14,480 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-10 00:38:14,481 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 00:38:14,482 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 00:38:14,489 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-11-10 00:38:14,493 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 00:38:14,494 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-10 00:38:14,495 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 00:38:14,497 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 00:38:14,501 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 00:38:14,501 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:41, output treesize:10 [2018-11-10 00:38:14,545 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:38:14,562 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 00:38:14,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12] total 17 [2018-11-10 00:38:14,563 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-10 00:38:14,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-10 00:38:14,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2018-11-10 00:38:14,563 INFO L87 Difference]: Start difference. First operand 143 states and 149 transitions. Second operand 17 states. [2018-11-10 00:38:15,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 00:38:15,000 INFO L93 Difference]: Finished difference Result 200 states and 209 transitions. [2018-11-10 00:38:15,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-10 00:38:15,000 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 48 [2018-11-10 00:38:15,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 00:38:15,001 INFO L225 Difference]: With dead ends: 200 [2018-11-10 00:38:15,001 INFO L226 Difference]: Without dead ends: 200 [2018-11-10 00:38:15,001 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=149, Invalid=607, Unknown=0, NotChecked=0, Total=756 [2018-11-10 00:38:15,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-11-10 00:38:15,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 158. [2018-11-10 00:38:15,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-11-10 00:38:15,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 165 transitions. [2018-11-10 00:38:15,004 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 165 transitions. Word has length 48 [2018-11-10 00:38:15,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 00:38:15,004 INFO L481 AbstractCegarLoop]: Abstraction has 158 states and 165 transitions. [2018-11-10 00:38:15,004 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-10 00:38:15,004 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 165 transitions. [2018-11-10 00:38:15,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-10 00:38:15,005 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 00:38:15,005 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 00:38:15,005 INFO L424 AbstractCegarLoop]: === Iteration 21 === [mainErr45REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr47REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION]=== [2018-11-10 00:38:15,005 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:38:15,006 INFO L82 PathProgramCache]: Analyzing trace with hash 958237278, now seen corresponding path program 1 times [2018-11-10 00:38:15,006 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:38:15,006 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:38:15,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:38:15,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:38:15,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:38:15,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 00:38:15,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 00:38:15,037 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-10 00:38:15,054 WARN L387 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-11-10 00:38:15,070 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 12:38:15 BoogieIcfgContainer [2018-11-10 00:38:15,070 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 00:38:15,070 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 00:38:15,070 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 00:38:15,071 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 00:38:15,071 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:38:08" (3/4) ... [2018-11-10 00:38:15,074 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 00:38:15,074 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 00:38:15,075 INFO L168 Benchmark]: Toolchain (without parser) took 7228.43 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 320.3 MB). Free memory was 950.0 MB in the beginning and 1.1 GB in the end (delta: -189.1 MB). Peak memory consumption was 131.3 MB. Max. memory is 11.5 GB. [2018-11-10 00:38:15,076 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 00:38:15,076 INFO L168 Benchmark]: CACSL2BoogieTranslator took 294.70 ms. Allocated memory is still 1.0 GB. Free memory was 950.0 MB in the beginning and 925.9 MB in the end (delta: 24.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. [2018-11-10 00:38:15,077 INFO L168 Benchmark]: Boogie Preprocessor took 76.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 925.9 MB in the beginning and 1.1 GB in the end (delta: -207.7 MB). Peak memory consumption was 15.9 MB. Max. memory is 11.5 GB. [2018-11-10 00:38:15,077 INFO L168 Benchmark]: RCFGBuilder took 523.93 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 69.4 MB). Peak memory consumption was 69.4 MB. Max. memory is 11.5 GB. [2018-11-10 00:38:15,080 INFO L168 Benchmark]: TraceAbstraction took 6325.84 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 180.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -74.9 MB). Peak memory consumption was 106.0 MB. Max. memory is 11.5 GB. [2018-11-10 00:38:15,080 INFO L168 Benchmark]: Witness Printer took 4.19 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 00:38:15,082 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 294.70 ms. Allocated memory is still 1.0 GB. Free memory was 950.0 MB in the beginning and 925.9 MB in the end (delta: 24.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 76.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 925.9 MB in the beginning and 1.1 GB in the end (delta: -207.7 MB). Peak memory consumption was 15.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 523.93 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 69.4 MB). Peak memory consumption was 69.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 6325.84 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 180.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -74.9 MB). Peak memory consumption was 106.0 MB. Max. memory is 11.5 GB. * Witness Printer took 4.19 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 985]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 985. Possible FailurePath: [L987] EXPR, FCALL malloc(sizeof(struct TSLL)) VAL [malloc(sizeof(struct TSLL))={14:0}] [L987] struct TSLL* null = malloc(sizeof(struct TSLL)); VAL [malloc(sizeof(struct TSLL))={14:0}, null={14:0}] [L988] FCALL null->next = ((void*)0) VAL [malloc(sizeof(struct TSLL))={14:0}, null={14:0}] [L989] FCALL null->prev = ((void*)0) VAL [malloc(sizeof(struct TSLL))={14:0}, null={14:0}] [L990] FCALL null->colour = BLACK VAL [malloc(sizeof(struct TSLL))={14:0}, null={14:0}] [L992] EXPR, FCALL malloc(sizeof(struct TSLL)) VAL [malloc(sizeof(struct TSLL))={15:0}, malloc(sizeof(struct TSLL))={14:0}, null={14:0}] [L992] struct TSLL* list = malloc(sizeof(struct TSLL)); VAL [list={15:0}, malloc(sizeof(struct TSLL))={15:0}, malloc(sizeof(struct TSLL))={14:0}, null={14:0}] [L993] FCALL list->next = null VAL [list={15:0}, malloc(sizeof(struct TSLL))={15:0}, malloc(sizeof(struct TSLL))={14:0}, null={14:0}] [L994] FCALL list->prev = null VAL [list={15:0}, malloc(sizeof(struct TSLL))={15:0}, malloc(sizeof(struct TSLL))={14:0}, null={14:0}] [L995] FCALL list->colour = BLACK VAL [list={15:0}, malloc(sizeof(struct TSLL))={15:0}, malloc(sizeof(struct TSLL))={14:0}, null={14:0}] [L997] struct TSLL* end = list; VAL [end={15:0}, list={15:0}, malloc(sizeof(struct TSLL))={15:0}, malloc(sizeof(struct TSLL))={14:0}, null={14:0}] [L1000] COND FALSE !(__VERIFIER_nondet_int()) [L1026] end = null [L1027] end = list VAL [end={15:0}, list={15:0}, malloc(sizeof(struct TSLL))={15:0}, malloc(sizeof(struct TSLL))={14:0}, null={14:0}] [L1030] COND FALSE !(!(null != end)) VAL [end={15:0}, list={15:0}, malloc(sizeof(struct TSLL))={15:0}, malloc(sizeof(struct TSLL))={14:0}, null={14:0}] [L1030] COND FALSE !(0) VAL [end={15:0}, list={15:0}, malloc(sizeof(struct TSLL))={15:0}, malloc(sizeof(struct TSLL))={14:0}, null={14:0}] [L1031] EXPR, FCALL end->colour VAL [end={15:0}, end->colour=1, list={15:0}, malloc(sizeof(struct TSLL))={15:0}, malloc(sizeof(struct TSLL))={14:0}, null={14:0}] [L1031] COND FALSE !(!(BLACK == end->colour)) [L1031] COND FALSE !(0) VAL [end={15:0}, list={15:0}, malloc(sizeof(struct TSLL))={15:0}, malloc(sizeof(struct TSLL))={14:0}, null={14:0}] [L1032] COND TRUE null != end VAL [end={15:0}, list={15:0}, malloc(sizeof(struct TSLL))={15:0}, malloc(sizeof(struct TSLL))={14:0}, null={14:0}] [L1034] EXPR, FCALL end->colour VAL [end={15:0}, end->colour=1, list={15:0}, malloc(sizeof(struct TSLL))={15:0}, malloc(sizeof(struct TSLL))={14:0}, null={14:0}] [L1034] COND FALSE !(RED == end->colour) [L1041] EXPR, FCALL end->next VAL [end={15:0}, end->next={14:0}, list={15:0}, malloc(sizeof(struct TSLL))={15:0}, malloc(sizeof(struct TSLL))={14:0}, null={14:0}] [L1041] end = end->next [L1032] COND FALSE !(null != end) VAL [end={14:0}, list={15:0}, malloc(sizeof(struct TSLL))={15:0}, malloc(sizeof(struct TSLL))={14:0}, null={14:0}] [L1045] COND TRUE null != list VAL [end={14:0}, list={15:0}, malloc(sizeof(struct TSLL))={15:0}, malloc(sizeof(struct TSLL))={14:0}, null={14:0}] [L1047] EXPR, FCALL list->colour VAL [end={14:0}, list={15:0}, list->colour=1, malloc(sizeof(struct TSLL))={15:0}, malloc(sizeof(struct TSLL))={14:0}, null={14:0}] [L1047] COND FALSE !(RED == list->colour) [L1056] EXPR, FCALL list->next VAL [end={14:0}, list={15:0}, list->next={14:0}, malloc(sizeof(struct TSLL))={15:0}, malloc(sizeof(struct TSLL))={14:0}, null={14:0}] [L1056] end = list->next [L1057] free(list) VAL [end={14:0}, list={15:0}, malloc(sizeof(struct TSLL))={15:0}, malloc(sizeof(struct TSLL))={14:0}, null={14:0}] [L1057] free(list) VAL [end={14:0}, list={15:0}, malloc(sizeof(struct TSLL))={15:0}, malloc(sizeof(struct TSLL))={14:0}, null={14:0}] [L1057] FCALL free(list) VAL [end={14:0}, list={15:0}, malloc(sizeof(struct TSLL))={15:0}, malloc(sizeof(struct TSLL))={14:0}, null={14:0}] [L1058] list = end VAL [end={14:0}, list={14:0}, malloc(sizeof(struct TSLL))={15:0}, malloc(sizeof(struct TSLL))={14:0}, null={14:0}] [L1045] COND FALSE !(null != list) VAL [end={14:0}, list={14:0}, malloc(sizeof(struct TSLL))={15:0}, malloc(sizeof(struct TSLL))={14:0}, null={14:0}] [L1062] return 0; VAL [\result=0, end={14:0}, list={14:0}, malloc(sizeof(struct TSLL))={15:0}, malloc(sizeof(struct TSLL))={14:0}, null={14:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 166 locations, 67 error locations. UNSAFE Result, 6.2s OverallTime, 21 OverallIterations, 2 TraceHistogramMax, 4.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2073 SDtfs, 4489 SDslu, 4379 SDs, 0 SdLazy, 5305 SolverSat, 265 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 323 GetRequests, 140 SyntacticMatches, 10 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=175occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 20 MinimizatonAttempts, 714 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 745 NumberOfCodeBlocks, 745 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 673 ConstructedInterpolants, 0 QuantifiedInterpolants, 133696 SizeOfPredicates, 27 NumberOfNonLiveVariables, 474 ConjunctsInSsa, 54 ConjunctsInUnsatCore, 23 InterpolantComputations, 18 PerfectInterpolantSequences, 8/22 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-1dbac8b [2018-11-10 00:38:16,570 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 00:38:16,572 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 00:38:16,580 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 00:38:16,581 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 00:38:16,582 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 00:38:16,583 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 00:38:16,584 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 00:38:16,585 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 00:38:16,586 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 00:38:16,586 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 00:38:16,586 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 00:38:16,587 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 00:38:16,588 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 00:38:16,589 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 00:38:16,589 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 00:38:16,590 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 00:38:16,592 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 00:38:16,593 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 00:38:16,595 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 00:38:16,595 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 00:38:16,596 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 00:38:16,598 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 00:38:16,598 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 00:38:16,599 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 00:38:16,599 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 00:38:16,600 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 00:38:16,601 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 00:38:16,602 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 00:38:16,602 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 00:38:16,603 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 00:38:16,603 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 00:38:16,603 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 00:38:16,603 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 00:38:16,604 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 00:38:16,604 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 00:38:16,605 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_d64cda5f-b449-499c-abc1-5cd796bc5494/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2018-11-10 00:38:16,616 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 00:38:16,616 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 00:38:16,617 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 00:38:16,617 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 00:38:16,617 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 00:38:16,617 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 00:38:16,617 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 00:38:16,617 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 00:38:16,618 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 00:38:16,618 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 00:38:16,618 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 00:38:16,618 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-11-10 00:38:16,618 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-11-10 00:38:16,618 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-11-10 00:38:16,618 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 00:38:16,618 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-10 00:38:16,619 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-10 00:38:16,619 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 00:38:16,619 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 00:38:16,619 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 00:38:16,619 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 00:38:16,619 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 00:38:16,619 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 00:38:16,620 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 00:38:16,620 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 00:38:16,620 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-10 00:38:16,620 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 00:38:16,620 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-10 00:38:16,620 INFO L133 SettingsManager]: * Logic for external solver=AUFBV Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_d64cda5f-b449-499c-abc1-5cd796bc5494/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b9633ec6dc7e01a7231c1be5ed310faef61ba6b0 [2018-11-10 00:38:16,651 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 00:38:16,660 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 00:38:16,663 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 00:38:16,664 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 00:38:16,664 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 00:38:16,665 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_d64cda5f-b449-499c-abc1-5cd796bc5494/bin-2019/uautomizer/../../sv-benchmarks/c/forester-heap/dll-rb-sentinel_false-unreach-call_false-valid-memtrack.i [2018-11-10 00:38:16,710 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d64cda5f-b449-499c-abc1-5cd796bc5494/bin-2019/uautomizer/data/1cd0829d3/20d4284081114db8832a0ec06b1d9ad8/FLAG79be2d74f [2018-11-10 00:38:17,074 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 00:38:17,074 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_d64cda5f-b449-499c-abc1-5cd796bc5494/sv-benchmarks/c/forester-heap/dll-rb-sentinel_false-unreach-call_false-valid-memtrack.i [2018-11-10 00:38:17,081 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d64cda5f-b449-499c-abc1-5cd796bc5494/bin-2019/uautomizer/data/1cd0829d3/20d4284081114db8832a0ec06b1d9ad8/FLAG79be2d74f [2018-11-10 00:38:17,092 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_d64cda5f-b449-499c-abc1-5cd796bc5494/bin-2019/uautomizer/data/1cd0829d3/20d4284081114db8832a0ec06b1d9ad8 [2018-11-10 00:38:17,094 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 00:38:17,095 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-10 00:38:17,096 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 00:38:17,096 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 00:38:17,099 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 00:38:17,100 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:38:17" (1/1) ... [2018-11-10 00:38:17,102 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@150901fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:38:17, skipping insertion in model container [2018-11-10 00:38:17,102 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:38:17" (1/1) ... [2018-11-10 00:38:17,111 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 00:38:17,140 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 00:38:17,343 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 00:38:17,353 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 00:38:17,389 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 00:38:17,416 INFO L193 MainTranslator]: Completed translation [2018-11-10 00:38:17,417 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:38:17 WrapperNode [2018-11-10 00:38:17,417 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 00:38:17,418 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 00:38:17,418 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 00:38:17,418 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 00:38:17,426 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:38:17" (1/1) ... [2018-11-10 00:38:17,426 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:38:17" (1/1) ... [2018-11-10 00:38:17,478 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:38:17" (1/1) ... [2018-11-10 00:38:17,479 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:38:17" (1/1) ... [2018-11-10 00:38:17,493 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:38:17" (1/1) ... [2018-11-10 00:38:17,500 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:38:17" (1/1) ... [2018-11-10 00:38:17,503 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:38:17" (1/1) ... [2018-11-10 00:38:17,507 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 00:38:17,508 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 00:38:17,508 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 00:38:17,508 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 00:38:17,509 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:38:17" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d64cda5f-b449-499c-abc1-5cd796bc5494/bin-2019/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 [2018-11-10 00:38:17,543 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 00:38:17,544 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 00:38:17,544 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 00:38:17,544 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-10 00:38:17,544 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-10 00:38:17,544 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-10 00:38:17,544 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-10 00:38:17,544 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-10 00:38:17,544 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-10 00:38:17,544 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-10 00:38:17,544 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-10 00:38:17,545 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-10 00:38:17,545 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-10 00:38:17,545 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-10 00:38:17,545 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-10 00:38:17,545 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-10 00:38:17,545 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-10 00:38:17,545 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-10 00:38:17,546 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-10 00:38:17,546 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-10 00:38:17,546 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-10 00:38:17,546 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-10 00:38:17,546 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-10 00:38:17,546 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-10 00:38:17,546 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-10 00:38:17,547 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-10 00:38:17,547 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-10 00:38:17,547 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-10 00:38:17,547 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-10 00:38:17,547 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-10 00:38:17,547 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-10 00:38:17,547 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-10 00:38:17,547 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-10 00:38:17,548 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-10 00:38:17,548 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-10 00:38:17,548 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-10 00:38:17,548 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-10 00:38:17,548 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-10 00:38:17,548 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-10 00:38:17,548 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-10 00:38:17,548 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-10 00:38:17,549 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-10 00:38:17,549 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-10 00:38:17,549 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-10 00:38:17,549 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-10 00:38:17,549 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-10 00:38:17,549 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-10 00:38:17,549 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-10 00:38:17,549 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-10 00:38:17,549 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-10 00:38:17,549 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-10 00:38:17,550 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-10 00:38:17,550 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-10 00:38:17,550 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-10 00:38:17,550 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-10 00:38:17,550 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-10 00:38:17,550 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-10 00:38:17,550 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-10 00:38:17,550 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-10 00:38:17,550 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-10 00:38:17,551 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-10 00:38:17,551 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-11-10 00:38:17,551 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-10 00:38:17,551 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-10 00:38:17,551 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-11-10 00:38:17,551 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-10 00:38:17,551 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-10 00:38:17,551 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2018-11-10 00:38:17,551 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-10 00:38:17,551 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-10 00:38:17,552 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-10 00:38:17,552 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-10 00:38:17,552 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-10 00:38:17,552 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-10 00:38:17,552 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-10 00:38:17,552 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-10 00:38:17,552 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-10 00:38:17,552 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-10 00:38:17,552 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-10 00:38:17,552 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-10 00:38:17,553 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-10 00:38:17,553 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-10 00:38:17,553 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-10 00:38:17,553 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-10 00:38:17,553 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-10 00:38:17,553 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-10 00:38:17,553 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-10 00:38:17,553 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-10 00:38:17,553 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-10 00:38:17,553 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-10 00:38:17,553 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-10 00:38:17,554 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-10 00:38:17,554 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-10 00:38:17,554 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-10 00:38:17,554 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-10 00:38:17,554 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-10 00:38:17,554 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-10 00:38:17,554 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-10 00:38:17,554 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-10 00:38:17,554 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-10 00:38:17,554 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-10 00:38:17,555 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-10 00:38:17,555 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-10 00:38:17,555 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-10 00:38:17,555 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-10 00:38:17,555 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-10 00:38:17,555 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-10 00:38:17,555 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-10 00:38:17,555 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 00:38:17,555 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-10 00:38:17,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-10 00:38:17,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-10 00:38:17,556 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-10 00:38:17,556 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-10 00:38:17,556 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-10 00:38:17,556 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 00:38:17,556 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 00:38:17,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-11-10 00:38:18,189 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 00:38:18,190 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:38:18 BoogieIcfgContainer [2018-11-10 00:38:18,190 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 00:38:18,191 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 00:38:18,191 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 00:38:18,193 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 00:38:18,193 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 12:38:17" (1/3) ... [2018-11-10 00:38:18,194 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4814a5d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:38:18, skipping insertion in model container [2018-11-10 00:38:18,194 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:38:17" (2/3) ... [2018-11-10 00:38:18,194 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4814a5d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:38:18, skipping insertion in model container [2018-11-10 00:38:18,194 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:38:18" (3/3) ... [2018-11-10 00:38:18,195 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-rb-sentinel_false-unreach-call_false-valid-memtrack.i [2018-11-10 00:38:18,201 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 00:38:18,207 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 67 error locations. [2018-11-10 00:38:18,217 INFO L257 AbstractCegarLoop]: Starting to check reachability of 67 error locations. [2018-11-10 00:38:18,233 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 00:38:18,234 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 00:38:18,234 INFO L383 AbstractCegarLoop]: Hoare is false [2018-11-10 00:38:18,234 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 00:38:18,234 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 00:38:18,234 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 00:38:18,234 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 00:38:18,234 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 00:38:18,235 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 00:38:18,249 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states. [2018-11-10 00:38:18,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-11-10 00:38:18,256 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 00:38:18,257 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 00:38:18,260 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr62REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr50REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION]=== [2018-11-10 00:38:18,264 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:38:18,265 INFO L82 PathProgramCache]: Analyzing trace with hash 981654736, now seen corresponding path program 1 times [2018-11-10 00:38:18,267 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 00:38:18,268 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d64cda5f-b449-499c-abc1-5cd796bc5494/bin-2019/uautomizer/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 00:38:18,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:38:18,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:38:18,317 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 00:38:18,347 INFO L477 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 [2018-11-10 00:38:18,348 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 00:38:18,353 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 00:38:18,353 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-10 00:38:18,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:38:18,365 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 00:38:18,368 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 00:38:18,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 00:38:18,372 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 00:38:18,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 00:38:18,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 00:38:18,386 INFO L87 Difference]: Start difference. First operand 164 states. Second operand 4 states. [2018-11-10 00:38:18,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 00:38:18,706 INFO L93 Difference]: Finished difference Result 189 states and 196 transitions. [2018-11-10 00:38:18,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 00:38:18,708 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-11-10 00:38:18,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 00:38:18,716 INFO L225 Difference]: With dead ends: 189 [2018-11-10 00:38:18,716 INFO L226 Difference]: Without dead ends: 185 [2018-11-10 00:38:18,718 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 00:38:18,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-11-10 00:38:18,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 158. [2018-11-10 00:38:18,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-11-10 00:38:18,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 163 transitions. [2018-11-10 00:38:18,751 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 163 transitions. Word has length 8 [2018-11-10 00:38:18,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 00:38:18,751 INFO L481 AbstractCegarLoop]: Abstraction has 158 states and 163 transitions. [2018-11-10 00:38:18,751 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 00:38:18,751 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 163 transitions. [2018-11-10 00:38:18,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-11-10 00:38:18,752 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 00:38:18,752 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 00:38:18,752 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr62REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr50REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION]=== [2018-11-10 00:38:18,752 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:38:18,753 INFO L82 PathProgramCache]: Analyzing trace with hash 981654737, now seen corresponding path program 1 times [2018-11-10 00:38:18,753 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 00:38:18,753 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d64cda5f-b449-499c-abc1-5cd796bc5494/bin-2019/uautomizer/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 00:38:18,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:38:18,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:38:18,796 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 00:38:18,806 INFO L477 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 [2018-11-10 00:38:18,806 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 00:38:18,814 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 00:38:18,815 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-10 00:38:18,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:38:18,830 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 00:38:18,832 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 00:38:18,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 00:38:18,833 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 00:38:18,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 00:38:18,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 00:38:18,833 INFO L87 Difference]: Start difference. First operand 158 states and 163 transitions. Second operand 4 states. [2018-11-10 00:38:19,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 00:38:19,090 INFO L93 Difference]: Finished difference Result 155 states and 160 transitions. [2018-11-10 00:38:19,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 00:38:19,091 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-11-10 00:38:19,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 00:38:19,092 INFO L225 Difference]: With dead ends: 155 [2018-11-10 00:38:19,092 INFO L226 Difference]: Without dead ends: 155 [2018-11-10 00:38:19,093 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 00:38:19,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-11-10 00:38:19,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2018-11-10 00:38:19,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-11-10 00:38:19,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 160 transitions. [2018-11-10 00:38:19,098 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 160 transitions. Word has length 8 [2018-11-10 00:38:19,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 00:38:19,098 INFO L481 AbstractCegarLoop]: Abstraction has 155 states and 160 transitions. [2018-11-10 00:38:19,098 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 00:38:19,099 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 160 transitions. [2018-11-10 00:38:19,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-10 00:38:19,099 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 00:38:19,099 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 00:38:19,099 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr62REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr50REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION]=== [2018-11-10 00:38:19,100 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:38:19,100 INFO L82 PathProgramCache]: Analyzing trace with hash -762761379, now seen corresponding path program 1 times [2018-11-10 00:38:19,100 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 00:38:19,100 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d64cda5f-b449-499c-abc1-5cd796bc5494/bin-2019/uautomizer/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 00:38:19,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:38:19,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:38:19,146 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 00:38:19,166 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-10 00:38:19,166 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 00:38:19,172 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 00:38:19,172 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-11-10 00:38:19,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:38:19,223 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 00:38:19,225 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 00:38:19,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 00:38:19,225 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 00:38:19,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 00:38:19,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 00:38:19,226 INFO L87 Difference]: Start difference. First operand 155 states and 160 transitions. Second operand 5 states. [2018-11-10 00:38:19,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 00:38:19,468 INFO L93 Difference]: Finished difference Result 170 states and 176 transitions. [2018-11-10 00:38:19,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 00:38:19,468 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-11-10 00:38:19,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 00:38:19,469 INFO L225 Difference]: With dead ends: 170 [2018-11-10 00:38:19,469 INFO L226 Difference]: Without dead ends: 170 [2018-11-10 00:38:19,469 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-11-10 00:38:19,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-11-10 00:38:19,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 151. [2018-11-10 00:38:19,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-11-10 00:38:19,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 158 transitions. [2018-11-10 00:38:19,474 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 158 transitions. Word has length 13 [2018-11-10 00:38:19,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 00:38:19,475 INFO L481 AbstractCegarLoop]: Abstraction has 151 states and 158 transitions. [2018-11-10 00:38:19,475 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 00:38:19,475 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 158 transitions. [2018-11-10 00:38:19,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-10 00:38:19,475 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 00:38:19,475 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 00:38:19,476 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr62REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr50REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION]=== [2018-11-10 00:38:19,476 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:38:19,476 INFO L82 PathProgramCache]: Analyzing trace with hash -762761378, now seen corresponding path program 1 times [2018-11-10 00:38:19,477 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 00:38:19,477 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d64cda5f-b449-499c-abc1-5cd796bc5494/bin-2019/uautomizer/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 00:38:19,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:38:19,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:38:19,517 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 00:38:19,521 INFO L477 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 [2018-11-10 00:38:19,521 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 00:38:19,525 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 00:38:19,525 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-10 00:38:19,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:38:19,547 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 00:38:19,548 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 00:38:19,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 00:38:19,549 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 00:38:19,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 00:38:19,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 00:38:19,549 INFO L87 Difference]: Start difference. First operand 151 states and 158 transitions. Second operand 4 states. [2018-11-10 00:38:19,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 00:38:19,810 INFO L93 Difference]: Finished difference Result 167 states and 173 transitions. [2018-11-10 00:38:19,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 00:38:19,811 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-11-10 00:38:19,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 00:38:19,812 INFO L225 Difference]: With dead ends: 167 [2018-11-10 00:38:19,812 INFO L226 Difference]: Without dead ends: 167 [2018-11-10 00:38:19,812 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 00:38:19,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-11-10 00:38:19,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 155. [2018-11-10 00:38:19,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-11-10 00:38:19,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 162 transitions. [2018-11-10 00:38:19,817 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 162 transitions. Word has length 13 [2018-11-10 00:38:19,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 00:38:19,817 INFO L481 AbstractCegarLoop]: Abstraction has 155 states and 162 transitions. [2018-11-10 00:38:19,817 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 00:38:19,818 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 162 transitions. [2018-11-10 00:38:19,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-10 00:38:19,818 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 00:38:19,818 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 00:38:19,818 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr62REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr50REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION]=== [2018-11-10 00:38:19,819 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:38:19,819 INFO L82 PathProgramCache]: Analyzing trace with hash 2061857601, now seen corresponding path program 1 times [2018-11-10 00:38:19,819 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 00:38:19,819 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d64cda5f-b449-499c-abc1-5cd796bc5494/bin-2019/uautomizer/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 00:38:19,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:38:19,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:38:19,877 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 00:38:19,880 INFO L477 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 [2018-11-10 00:38:19,880 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 00:38:19,881 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 00:38:19,882 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-10 00:38:19,905 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 00:38:19,907 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 00:38:19,907 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-11-10 00:38:19,908 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 00:38:19,914 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 00:38:19,914 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:16 [2018-11-10 00:38:19,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:38:19,928 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 00:38:19,929 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 00:38:19,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 00:38:19,929 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 00:38:19,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 00:38:19,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-10 00:38:19,930 INFO L87 Difference]: Start difference. First operand 155 states and 162 transitions. Second operand 6 states. [2018-11-10 00:38:20,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 00:38:20,354 INFO L93 Difference]: Finished difference Result 162 states and 170 transitions. [2018-11-10 00:38:20,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 00:38:20,354 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-11-10 00:38:20,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 00:38:20,355 INFO L225 Difference]: With dead ends: 162 [2018-11-10 00:38:20,355 INFO L226 Difference]: Without dead ends: 162 [2018-11-10 00:38:20,355 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-11-10 00:38:20,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-11-10 00:38:20,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 143. [2018-11-10 00:38:20,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-11-10 00:38:20,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 152 transitions. [2018-11-10 00:38:20,360 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 152 transitions. Word has length 20 [2018-11-10 00:38:20,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 00:38:20,361 INFO L481 AbstractCegarLoop]: Abstraction has 143 states and 152 transitions. [2018-11-10 00:38:20,361 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 00:38:20,361 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 152 transitions. [2018-11-10 00:38:20,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-10 00:38:20,362 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 00:38:20,363 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 00:38:20,363 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr62REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr50REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION]=== [2018-11-10 00:38:20,363 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:38:20,363 INFO L82 PathProgramCache]: Analyzing trace with hash 2061857602, now seen corresponding path program 1 times [2018-11-10 00:38:20,364 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 00:38:20,364 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d64cda5f-b449-499c-abc1-5cd796bc5494/bin-2019/uautomizer/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 00:38:20,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:38:20,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:38:20,437 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 00:38:20,441 INFO L477 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 [2018-11-10 00:38:20,441 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 00:38:20,454 INFO L477 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 [2018-11-10 00:38:20,454 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 00:38:20,462 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 00:38:20,462 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-11-10 00:38:20,502 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 00:38:20,504 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 00:38:20,504 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-10 00:38:20,504 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 00:38:20,516 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-11-10 00:38:20,516 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 00:38:20,540 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 00:38:20,541 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:20 [2018-11-10 00:38:20,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:38:20,560 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 00:38:20,565 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 00:38:20,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 00:38:20,566 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 00:38:20,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 00:38:20,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 00:38:20,566 INFO L87 Difference]: Start difference. First operand 143 states and 152 transitions. Second operand 6 states. [2018-11-10 00:38:21,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 00:38:21,178 INFO L93 Difference]: Finished difference Result 177 states and 187 transitions. [2018-11-10 00:38:21,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 00:38:21,179 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-11-10 00:38:21,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 00:38:21,179 INFO L225 Difference]: With dead ends: 177 [2018-11-10 00:38:21,179 INFO L226 Difference]: Without dead ends: 177 [2018-11-10 00:38:21,180 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-10 00:38:21,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-11-10 00:38:21,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 153. [2018-11-10 00:38:21,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-11-10 00:38:21,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 165 transitions. [2018-11-10 00:38:21,184 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 165 transitions. Word has length 20 [2018-11-10 00:38:21,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 00:38:21,185 INFO L481 AbstractCegarLoop]: Abstraction has 153 states and 165 transitions. [2018-11-10 00:38:21,185 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 00:38:21,185 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 165 transitions. [2018-11-10 00:38:21,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-10 00:38:21,185 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 00:38:21,185 INFO L375 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] [2018-11-10 00:38:21,185 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr62REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr50REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION]=== [2018-11-10 00:38:21,185 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:38:21,185 INFO L82 PathProgramCache]: Analyzing trace with hash 1465231396, now seen corresponding path program 1 times [2018-11-10 00:38:21,186 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 00:38:21,186 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d64cda5f-b449-499c-abc1-5cd796bc5494/bin-2019/uautomizer/cvc4nyu Starting monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 00:38:21,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:38:21,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:38:21,239 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 00:38:21,244 INFO L477 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 [2018-11-10 00:38:21,244 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 00:38:21,262 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 00:38:21,262 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-10 00:38:21,268 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 00:38:21,270 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 00:38:21,270 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 00:38:21,272 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 00:38:21,277 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 00:38:21,277 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:11 [2018-11-10 00:38:21,284 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 00:38:21,286 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2018-11-10 00:38:21,286 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 00:38:21,289 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 00:38:21,290 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 00:38:21,290 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:7 [2018-11-10 00:38:21,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:38:21,295 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 00:38:21,297 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 00:38:21,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 00:38:21,297 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 00:38:21,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 00:38:21,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 00:38:21,297 INFO L87 Difference]: Start difference. First operand 153 states and 165 transitions. Second operand 5 states. [2018-11-10 00:38:21,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 00:38:21,688 INFO L93 Difference]: Finished difference Result 204 states and 220 transitions. [2018-11-10 00:38:21,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 00:38:21,689 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-11-10 00:38:21,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 00:38:21,690 INFO L225 Difference]: With dead ends: 204 [2018-11-10 00:38:21,690 INFO L226 Difference]: Without dead ends: 204 [2018-11-10 00:38:21,690 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-10 00:38:21,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-11-10 00:38:21,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 152. [2018-11-10 00:38:21,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-11-10 00:38:21,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 163 transitions. [2018-11-10 00:38:21,694 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 163 transitions. Word has length 22 [2018-11-10 00:38:21,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 00:38:21,694 INFO L481 AbstractCegarLoop]: Abstraction has 152 states and 163 transitions. [2018-11-10 00:38:21,694 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 00:38:21,694 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 163 transitions. [2018-11-10 00:38:21,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-10 00:38:21,695 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 00:38:21,695 INFO L375 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] [2018-11-10 00:38:21,695 INFO L424 AbstractCegarLoop]: === Iteration 8 === [mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr62REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr50REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION]=== [2018-11-10 00:38:21,695 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:38:21,695 INFO L82 PathProgramCache]: Analyzing trace with hash 1465231397, now seen corresponding path program 1 times [2018-11-10 00:38:21,695 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 00:38:21,695 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d64cda5f-b449-499c-abc1-5cd796bc5494/bin-2019/uautomizer/cvc4nyu Starting monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 00:38:21,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:38:21,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:38:21,777 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 00:38:21,780 INFO L477 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 [2018-11-10 00:38:21,780 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 00:38:21,784 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 00:38:21,784 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-10 00:38:21,795 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 00:38:21,797 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 00:38:21,797 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 00:38:21,799 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 00:38:21,809 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 00:38:21,811 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 00:38:21,811 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 00:38:21,813 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 00:38:21,819 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 00:38:21,820 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:28, output treesize:17 [2018-11-10 00:38:21,830 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-10 00:38:21,832 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-10 00:38:21,833 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 00:38:21,834 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 00:38:21,842 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-10 00:38:21,844 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-10 00:38:21,844 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 00:38:21,846 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 00:38:21,849 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 00:38:21,849 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:31, output treesize:9 [2018-11-10 00:38:21,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:38:21,857 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 00:38:21,859 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 00:38:21,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 00:38:21,859 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 00:38:21,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 00:38:21,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 00:38:21,859 INFO L87 Difference]: Start difference. First operand 152 states and 163 transitions. Second operand 5 states. [2018-11-10 00:38:22,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 00:38:22,315 INFO L93 Difference]: Finished difference Result 228 states and 245 transitions. [2018-11-10 00:38:22,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 00:38:22,316 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-11-10 00:38:22,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 00:38:22,317 INFO L225 Difference]: With dead ends: 228 [2018-11-10 00:38:22,317 INFO L226 Difference]: Without dead ends: 228 [2018-11-10 00:38:22,317 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-10 00:38:22,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2018-11-10 00:38:22,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 151. [2018-11-10 00:38:22,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-11-10 00:38:22,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 161 transitions. [2018-11-10 00:38:22,320 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 161 transitions. Word has length 22 [2018-11-10 00:38:22,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 00:38:22,320 INFO L481 AbstractCegarLoop]: Abstraction has 151 states and 161 transitions. [2018-11-10 00:38:22,320 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 00:38:22,320 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 161 transitions. [2018-11-10 00:38:22,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-10 00:38:22,321 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 00:38:22,321 INFO L375 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] [2018-11-10 00:38:22,321 INFO L424 AbstractCegarLoop]: === Iteration 9 === [mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr62REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr50REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION]=== [2018-11-10 00:38:22,321 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:38:22,322 INFO L82 PathProgramCache]: Analyzing trace with hash -431749594, now seen corresponding path program 1 times [2018-11-10 00:38:22,322 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 00:38:22,322 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d64cda5f-b449-499c-abc1-5cd796bc5494/bin-2019/uautomizer/cvc4nyu Starting monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 00:38:22,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:38:22,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:38:22,420 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 00:38:22,442 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-10 00:38:22,442 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 00:38:22,451 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 00:38:22,451 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-11-10 00:38:22,473 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 00:38:22,474 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 00:38:22,475 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-11-10 00:38:22,475 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 00:38:22,481 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 00:38:22,481 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-11-10 00:38:22,498 INFO L477 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 11 treesize of output 8 [2018-11-10 00:38:22,501 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 00:38:22,502 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 00:38:22,504 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 00:38:22,513 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 00:38:22,513 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:26 [2018-11-10 00:38:22,568 INFO L477 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 0 case distinctions, treesize of input 41 treesize of output 37 [2018-11-10 00:38:22,572 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-11-10 00:38:22,572 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 00:38:22,587 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 00:38:22,602 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 00:38:22,602 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:39 [2018-11-10 00:38:22,650 INFO L477 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 40 treesize of output 28 [2018-11-10 00:38:22,654 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 12 [2018-11-10 00:38:22,655 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 00:38:22,666 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-11-10 00:38:22,666 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 00:38:22,670 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 00:38:22,679 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 00:38:22,679 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:46, output treesize:18 [2018-11-10 00:38:22,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:38:22,721 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 00:38:22,726 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 00:38:22,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-10 00:38:22,726 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-10 00:38:22,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-10 00:38:22,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2018-11-10 00:38:22,727 INFO L87 Difference]: Start difference. First operand 151 states and 161 transitions. Second operand 12 states. [2018-11-10 00:38:23,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 00:38:23,751 INFO L93 Difference]: Finished difference Result 211 states and 225 transitions. [2018-11-10 00:38:23,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-10 00:38:23,752 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2018-11-10 00:38:23,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 00:38:23,752 INFO L225 Difference]: With dead ends: 211 [2018-11-10 00:38:23,752 INFO L226 Difference]: Without dead ends: 211 [2018-11-10 00:38:23,753 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=151, Invalid=269, Unknown=0, NotChecked=0, Total=420 [2018-11-10 00:38:23,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-11-10 00:38:23,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 150. [2018-11-10 00:38:23,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-11-10 00:38:23,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 160 transitions. [2018-11-10 00:38:23,755 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 160 transitions. Word has length 26 [2018-11-10 00:38:23,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 00:38:23,755 INFO L481 AbstractCegarLoop]: Abstraction has 150 states and 160 transitions. [2018-11-10 00:38:23,755 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-10 00:38:23,756 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 160 transitions. [2018-11-10 00:38:23,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-10 00:38:23,756 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 00:38:23,756 INFO L375 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] [2018-11-10 00:38:23,756 INFO L424 AbstractCegarLoop]: === Iteration 10 === [mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr62REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr50REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION]=== [2018-11-10 00:38:23,757 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:38:23,757 INFO L82 PathProgramCache]: Analyzing trace with hash -431749593, now seen corresponding path program 1 times [2018-11-10 00:38:23,757 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 00:38:23,757 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d64cda5f-b449-499c-abc1-5cd796bc5494/bin-2019/uautomizer/cvc4nyu Starting monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 00:38:23,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:38:23,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:38:23,872 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 00:38:23,875 INFO L477 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 [2018-11-10 00:38:23,876 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 00:38:23,877 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 00:38:23,877 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-10 00:38:23,901 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 00:38:23,913 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 00:38:23,914 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-10 00:38:23,914 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 00:38:23,924 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-10 00:38:23,924 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 00:38:23,930 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 00:38:23,930 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-11-10 00:38:23,950 INFO L477 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 11 treesize of output 8 [2018-11-10 00:38:23,953 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 00:38:23,953 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 00:38:23,956 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 00:38:23,973 INFO L477 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 11 treesize of output 8 [2018-11-10 00:38:23,975 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 00:38:23,975 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 00:38:23,978 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 00:38:23,988 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 00:38:23,988 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:32, output treesize:25 [2018-11-10 00:38:24,052 INFO L477 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 0 case distinctions, treesize of input 60 treesize of output 56 [2018-11-10 00:38:24,055 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-11-10 00:38:24,056 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 00:38:24,070 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 00:38:24,103 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-11-10 00:38:24,107 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-11-10 00:38:24,107 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 00:38:24,118 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 00:38:24,155 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 00:38:24,156 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:67, output treesize:51 [2018-11-10 00:38:24,230 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2018-11-10 00:38:24,235 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-11-10 00:38:24,235 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 00:38:24,253 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-10 00:38:24,253 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 00:38:24,258 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 00:38:24,289 INFO L477 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 38 treesize of output 26 [2018-11-10 00:38:24,294 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-11-10 00:38:24,294 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-10 00:38:24,306 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-11-10 00:38:24,307 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-10 00:38:24,311 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 00:38:24,317 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 00:38:24,317 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:65, output treesize:9 [2018-11-10 00:38:24,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:38:24,359 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 00:38:24,361 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 00:38:24,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-10 00:38:24,361 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-10 00:38:24,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 00:38:24,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-11-10 00:38:24,362 INFO L87 Difference]: Start difference. First operand 150 states and 160 transitions. Second operand 11 states. [2018-11-10 00:38:25,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 00:38:25,562 INFO L93 Difference]: Finished difference Result 183 states and 194 transitions. [2018-11-10 00:38:25,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-10 00:38:25,563 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 26 [2018-11-10 00:38:25,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 00:38:25,564 INFO L225 Difference]: With dead ends: 183 [2018-11-10 00:38:25,564 INFO L226 Difference]: Without dead ends: 183 [2018-11-10 00:38:25,565 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=224, Invalid=478, Unknown=0, NotChecked=0, Total=702 [2018-11-10 00:38:25,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-11-10 00:38:25,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 155. [2018-11-10 00:38:25,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-11-10 00:38:25,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 165 transitions. [2018-11-10 00:38:25,568 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 165 transitions. Word has length 26 [2018-11-10 00:38:25,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 00:38:25,568 INFO L481 AbstractCegarLoop]: Abstraction has 155 states and 165 transitions. [2018-11-10 00:38:25,568 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-10 00:38:25,568 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 165 transitions. [2018-11-10 00:38:25,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-10 00:38:25,569 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 00:38:25,569 INFO L375 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] [2018-11-10 00:38:25,570 INFO L424 AbstractCegarLoop]: === Iteration 11 === [mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr62REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr50REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION]=== [2018-11-10 00:38:25,570 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:38:25,570 INFO L82 PathProgramCache]: Analyzing trace with hash 1330192148, now seen corresponding path program 1 times [2018-11-10 00:38:25,571 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 00:38:25,571 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d64cda5f-b449-499c-abc1-5cd796bc5494/bin-2019/uautomizer/cvc4nyu Starting monitored process 12 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 00:38:25,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:38:25,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:38:25,602 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 00:38:25,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:38:25,620 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 00:38:25,621 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 00:38:25,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 00:38:25,622 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 00:38:25,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 00:38:25,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 00:38:25,622 INFO L87 Difference]: Start difference. First operand 155 states and 165 transitions. Second operand 3 states. [2018-11-10 00:38:25,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 00:38:25,745 INFO L93 Difference]: Finished difference Result 165 states and 175 transitions. [2018-11-10 00:38:25,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 00:38:25,745 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-10 00:38:25,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 00:38:25,746 INFO L225 Difference]: With dead ends: 165 [2018-11-10 00:38:25,746 INFO L226 Difference]: Without dead ends: 165 [2018-11-10 00:38:25,746 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 00:38:25,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-11-10 00:38:25,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 155. [2018-11-10 00:38:25,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-11-10 00:38:25,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 164 transitions. [2018-11-10 00:38:25,749 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 164 transitions. Word has length 32 [2018-11-10 00:38:25,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 00:38:25,750 INFO L481 AbstractCegarLoop]: Abstraction has 155 states and 164 transitions. [2018-11-10 00:38:25,750 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 00:38:25,750 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 164 transitions. [2018-11-10 00:38:25,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-10 00:38:25,750 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 00:38:25,750 INFO L375 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] [2018-11-10 00:38:25,751 INFO L424 AbstractCegarLoop]: === Iteration 12 === [mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr62REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr50REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION]=== [2018-11-10 00:38:25,751 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:38:25,751 INFO L82 PathProgramCache]: Analyzing trace with hash -1748334165, now seen corresponding path program 1 times [2018-11-10 00:38:25,751 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 00:38:25,751 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d64cda5f-b449-499c-abc1-5cd796bc5494/bin-2019/uautomizer/cvc4nyu Starting monitored process 13 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 00:38:25,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:38:25,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:38:25,834 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 00:38:25,839 INFO L477 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 [2018-11-10 00:38:25,839 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 00:38:25,840 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 00:38:25,841 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-10 00:38:25,848 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 00:38:25,850 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 00:38:25,850 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 00:38:25,852 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 00:38:25,857 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 00:38:25,858 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2018-11-10 00:38:25,864 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-10 00:38:25,876 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-10 00:38:25,876 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 00:38:25,877 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 00:38:25,879 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 00:38:25,879 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-11-10 00:38:25,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:38:25,885 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 00:38:25,889 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 00:38:25,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 00:38:25,890 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 00:38:25,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 00:38:25,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 00:38:25,890 INFO L87 Difference]: Start difference. First operand 155 states and 164 transitions. Second operand 5 states. [2018-11-10 00:38:26,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 00:38:26,291 INFO L93 Difference]: Finished difference Result 231 states and 246 transitions. [2018-11-10 00:38:26,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 00:38:26,291 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2018-11-10 00:38:26,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 00:38:26,292 INFO L225 Difference]: With dead ends: 231 [2018-11-10 00:38:26,292 INFO L226 Difference]: Without dead ends: 231 [2018-11-10 00:38:26,292 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-10 00:38:26,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2018-11-10 00:38:26,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 154. [2018-11-10 00:38:26,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-11-10 00:38:26,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 163 transitions. [2018-11-10 00:38:26,296 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 163 transitions. Word has length 32 [2018-11-10 00:38:26,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 00:38:26,296 INFO L481 AbstractCegarLoop]: Abstraction has 154 states and 163 transitions. [2018-11-10 00:38:26,296 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 00:38:26,296 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 163 transitions. [2018-11-10 00:38:26,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-10 00:38:26,297 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 00:38:26,297 INFO L375 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] [2018-11-10 00:38:26,299 INFO L424 AbstractCegarLoop]: === Iteration 13 === [mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr62REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr50REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION]=== [2018-11-10 00:38:26,299 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:38:26,299 INFO L82 PathProgramCache]: Analyzing trace with hash -1748334164, now seen corresponding path program 1 times [2018-11-10 00:38:26,300 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 00:38:26,300 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d64cda5f-b449-499c-abc1-5cd796bc5494/bin-2019/uautomizer/cvc4nyu Starting monitored process 14 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 00:38:26,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:38:26,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:38:26,404 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 00:38:26,409 INFO L477 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 [2018-11-10 00:38:26,409 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 00:38:26,413 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 00:38:26,413 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-10 00:38:26,436 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 00:38:26,441 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 00:38:26,441 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 00:38:26,444 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 00:38:26,454 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 00:38:26,457 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 00:38:26,457 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 00:38:26,459 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 00:38:26,465 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 00:38:26,466 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:28, output treesize:17 [2018-11-10 00:38:26,476 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-10 00:38:26,478 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-10 00:38:26,478 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 00:38:26,481 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 00:38:26,493 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-10 00:38:26,495 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-10 00:38:26,495 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 00:38:26,497 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 00:38:26,501 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 00:38:26,501 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:31, output treesize:9 [2018-11-10 00:38:26,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:38:26,510 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 00:38:26,514 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 00:38:26,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 00:38:26,515 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 00:38:26,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 00:38:26,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 00:38:26,515 INFO L87 Difference]: Start difference. First operand 154 states and 163 transitions. Second operand 5 states. [2018-11-10 00:38:26,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 00:38:26,941 INFO L93 Difference]: Finished difference Result 255 states and 272 transitions. [2018-11-10 00:38:26,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 00:38:26,941 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2018-11-10 00:38:26,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 00:38:26,942 INFO L225 Difference]: With dead ends: 255 [2018-11-10 00:38:26,942 INFO L226 Difference]: Without dead ends: 255 [2018-11-10 00:38:26,942 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-10 00:38:26,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2018-11-10 00:38:26,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 153. [2018-11-10 00:38:26,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-11-10 00:38:26,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 162 transitions. [2018-11-10 00:38:26,945 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 162 transitions. Word has length 32 [2018-11-10 00:38:26,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 00:38:26,945 INFO L481 AbstractCegarLoop]: Abstraction has 153 states and 162 transitions. [2018-11-10 00:38:26,945 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 00:38:26,945 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 162 transitions. [2018-11-10 00:38:26,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-10 00:38:26,946 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 00:38:26,946 INFO L375 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] [2018-11-10 00:38:26,946 INFO L424 AbstractCegarLoop]: === Iteration 14 === [mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr62REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr50REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION]=== [2018-11-10 00:38:26,946 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:38:26,946 INFO L82 PathProgramCache]: Analyzing trace with hash -616558823, now seen corresponding path program 1 times [2018-11-10 00:38:26,947 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 00:38:26,947 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d64cda5f-b449-499c-abc1-5cd796bc5494/bin-2019/uautomizer/cvc4nyu Starting monitored process 15 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 00:38:26,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:38:27,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:38:27,026 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 00:38:27,053 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 00:38:27,056 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 00:38:27,056 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 00:38:27,058 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 00:38:27,067 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 00:38:27,069 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 00:38:27,069 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 00:38:27,071 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 00:38:27,077 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 00:38:27,077 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:29, output treesize:21 [2018-11-10 00:38:27,096 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-11-10 00:38:27,099 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 00:38:27,100 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-11-10 00:38:27,100 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 00:38:27,107 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 00:38:27,129 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-11-10 00:38:27,133 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 00:38:27,134 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-11-10 00:38:27,134 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 00:38:27,142 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 00:38:27,160 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 00:38:27,160 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:47, output treesize:39 [2018-11-10 00:38:27,238 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-11-10 00:38:27,241 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2018-11-10 00:38:27,241 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 00:38:27,247 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 00:38:27,259 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-11-10 00:38:27,261 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 3 [2018-11-10 00:38:27,261 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 00:38:27,263 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 00:38:27,270 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 00:38:27,270 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:46, output treesize:10 [2018-11-10 00:38:27,320 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:38:27,320 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 00:38:27,431 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:38:27,433 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 00:38:27,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 6] total 15 [2018-11-10 00:38:27,433 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-10 00:38:27,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-10 00:38:27,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2018-11-10 00:38:27,434 INFO L87 Difference]: Start difference. First operand 153 states and 162 transitions. Second operand 15 states. [2018-11-10 00:38:28,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 00:38:28,440 INFO L93 Difference]: Finished difference Result 221 states and 234 transitions. [2018-11-10 00:38:28,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-10 00:38:28,441 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 35 [2018-11-10 00:38:28,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 00:38:28,441 INFO L225 Difference]: With dead ends: 221 [2018-11-10 00:38:28,442 INFO L226 Difference]: Without dead ends: 221 [2018-11-10 00:38:28,442 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=181, Invalid=469, Unknown=0, NotChecked=0, Total=650 [2018-11-10 00:38:28,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-11-10 00:38:28,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 171. [2018-11-10 00:38:28,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-11-10 00:38:28,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 182 transitions. [2018-11-10 00:38:28,447 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 182 transitions. Word has length 35 [2018-11-10 00:38:28,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 00:38:28,447 INFO L481 AbstractCegarLoop]: Abstraction has 171 states and 182 transitions. [2018-11-10 00:38:28,447 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-10 00:38:28,447 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 182 transitions. [2018-11-10 00:38:28,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-10 00:38:28,448 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 00:38:28,448 INFO L375 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] [2018-11-10 00:38:28,448 INFO L424 AbstractCegarLoop]: === Iteration 15 === [mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr62REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr50REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION]=== [2018-11-10 00:38:28,448 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:38:28,448 INFO L82 PathProgramCache]: Analyzing trace with hash 920415085, now seen corresponding path program 1 times [2018-11-10 00:38:28,449 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 00:38:28,449 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d64cda5f-b449-499c-abc1-5cd796bc5494/bin-2019/uautomizer/cvc4nyu Starting monitored process 16 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 00:38:28,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:38:28,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:38:28,588 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 00:38:28,592 INFO L477 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 7 treesize of output 5 [2018-11-10 00:38:28,593 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-10 00:38:28,593 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 00:38:28,594 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 00:38:28,594 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 00:38:28,594 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:7, output treesize:1 [2018-11-10 00:38:28,617 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 00:38:28,618 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 00:38:28,619 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-11-10 00:38:28,619 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 00:38:28,625 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 00:38:28,625 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-11-10 00:38:28,637 INFO L477 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 11 treesize of output 8 [2018-11-10 00:38:28,641 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 00:38:28,641 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 00:38:28,645 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 00:38:28,654 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 00:38:28,654 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:24 [2018-11-10 00:38:28,691 INFO L477 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 0 case distinctions, treesize of input 39 treesize of output 35 [2018-11-10 00:38:28,695 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-11-10 00:38:28,695 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 00:38:28,708 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 00:38:28,720 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 00:38:28,720 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:45, output treesize:37 [2018-11-10 00:38:28,750 INFO L477 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 38 treesize of output 26 [2018-11-10 00:38:28,753 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-11-10 00:38:28,753 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 00:38:28,763 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-11-10 00:38:28,763 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 00:38:28,767 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 00:38:28,771 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 00:38:28,771 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:44, output treesize:16 [2018-11-10 00:38:28,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:38:28,802 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 00:38:28,804 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 00:38:28,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-10 00:38:28,805 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 00:38:28,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 00:38:28,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-11-10 00:38:28,805 INFO L87 Difference]: Start difference. First operand 171 states and 182 transitions. Second operand 9 states. [2018-11-10 00:38:29,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 00:38:29,514 INFO L93 Difference]: Finished difference Result 178 states and 189 transitions. [2018-11-10 00:38:29,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-10 00:38:29,515 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 36 [2018-11-10 00:38:29,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 00:38:29,515 INFO L225 Difference]: With dead ends: 178 [2018-11-10 00:38:29,515 INFO L226 Difference]: Without dead ends: 178 [2018-11-10 00:38:29,516 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2018-11-10 00:38:29,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-11-10 00:38:29,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 170. [2018-11-10 00:38:29,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-11-10 00:38:29,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 181 transitions. [2018-11-10 00:38:29,518 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 181 transitions. Word has length 36 [2018-11-10 00:38:29,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 00:38:29,519 INFO L481 AbstractCegarLoop]: Abstraction has 170 states and 181 transitions. [2018-11-10 00:38:29,519 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 00:38:29,519 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 181 transitions. [2018-11-10 00:38:29,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-10 00:38:29,519 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 00:38:29,520 INFO L375 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] [2018-11-10 00:38:29,520 INFO L424 AbstractCegarLoop]: === Iteration 16 === [mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr62REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr50REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION]=== [2018-11-10 00:38:29,520 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:38:29,520 INFO L82 PathProgramCache]: Analyzing trace with hash 920415086, now seen corresponding path program 1 times [2018-11-10 00:38:29,520 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 00:38:29,520 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d64cda5f-b449-499c-abc1-5cd796bc5494/bin-2019/uautomizer/cvc4nyu Starting monitored process 17 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 00:38:29,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:38:29,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:38:29,662 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 00:38:29,664 INFO L477 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 [2018-11-10 00:38:29,664 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 00:38:29,666 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 00:38:29,666 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-10 00:38:29,706 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 00:38:29,707 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 00:38:29,707 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-11-10 00:38:29,708 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 00:38:29,715 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 00:38:29,715 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-11-10 00:38:29,728 INFO L477 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 11 treesize of output 8 [2018-11-10 00:38:29,730 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 00:38:29,730 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 00:38:29,732 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 00:38:29,739 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 00:38:29,739 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:26 [2018-11-10 00:38:29,780 INFO L477 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 0 case distinctions, treesize of input 41 treesize of output 37 [2018-11-10 00:38:29,782 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-11-10 00:38:29,783 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 00:38:29,791 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 00:38:29,802 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 00:38:29,802 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:39 [2018-11-10 00:38:29,835 INFO L477 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 40 treesize of output 28 [2018-11-10 00:38:29,838 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-11-10 00:38:29,838 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 00:38:29,845 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 12 [2018-11-10 00:38:29,845 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 00:38:29,849 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 00:38:29,853 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 00:38:29,853 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:46, output treesize:18 [2018-11-10 00:38:29,887 INFO L477 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 [2018-11-10 00:38:29,887 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 00:38:29,906 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 00:38:29,906 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 00:38:29,907 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-10 00:38:29,907 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 00:38:29,916 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 00:38:29,916 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:13 [2018-11-10 00:38:29,938 INFO L477 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 11 treesize of output 8 [2018-11-10 00:38:29,940 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 00:38:29,941 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 00:38:29,943 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 00:38:29,954 INFO L477 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 11 treesize of output 8 [2018-11-10 00:38:29,956 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 00:38:29,956 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 00:38:29,958 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 00:38:29,966 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 00:38:29,966 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:32, output treesize:25 [2018-11-10 00:38:30,035 INFO L477 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 0 case distinctions, treesize of input 60 treesize of output 56 [2018-11-10 00:38:30,038 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-11-10 00:38:30,038 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 00:38:30,051 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 00:38:30,077 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-11-10 00:38:30,080 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-11-10 00:38:30,080 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 00:38:30,088 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 00:38:30,103 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 00:38:30,103 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:67, output treesize:51 [2018-11-10 00:38:30,156 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2018-11-10 00:38:30,160 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-11-10 00:38:30,160 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 00:38:30,172 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-10 00:38:30,173 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 00:38:30,176 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 00:38:30,194 INFO L477 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 38 treesize of output 26 [2018-11-10 00:38:30,198 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-11-10 00:38:30,198 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-10 00:38:30,206 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-11-10 00:38:30,206 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-10 00:38:30,210 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 00:38:30,214 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 00:38:30,215 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:65, output treesize:9 [2018-11-10 00:38:30,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:38:30,262 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 00:38:30,264 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 00:38:30,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-11-10 00:38:30,264 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-10 00:38:30,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-10 00:38:30,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2018-11-10 00:38:30,265 INFO L87 Difference]: Start difference. First operand 170 states and 181 transitions. Second operand 17 states. [2018-11-10 00:38:31,366 WARN L179 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2018-11-10 00:38:32,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 00:38:32,508 INFO L93 Difference]: Finished difference Result 188 states and 199 transitions. [2018-11-10 00:38:32,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-10 00:38:32,509 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 36 [2018-11-10 00:38:32,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 00:38:32,510 INFO L225 Difference]: With dead ends: 188 [2018-11-10 00:38:32,510 INFO L226 Difference]: Without dead ends: 188 [2018-11-10 00:38:32,510 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=368, Invalid=1192, Unknown=0, NotChecked=0, Total=1560 [2018-11-10 00:38:32,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-11-10 00:38:32,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 144. [2018-11-10 00:38:32,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-11-10 00:38:32,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 154 transitions. [2018-11-10 00:38:32,513 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 154 transitions. Word has length 36 [2018-11-10 00:38:32,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 00:38:32,514 INFO L481 AbstractCegarLoop]: Abstraction has 144 states and 154 transitions. [2018-11-10 00:38:32,514 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-10 00:38:32,514 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 154 transitions. [2018-11-10 00:38:32,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-10 00:38:32,514 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 00:38:32,514 INFO L375 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] [2018-11-10 00:38:32,515 INFO L424 AbstractCegarLoop]: === Iteration 17 === [mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr62REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr50REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION]=== [2018-11-10 00:38:32,515 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:38:32,515 INFO L82 PathProgramCache]: Analyzing trace with hash -1733993443, now seen corresponding path program 1 times [2018-11-10 00:38:32,515 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 00:38:32,515 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d64cda5f-b449-499c-abc1-5cd796bc5494/bin-2019/uautomizer/cvc4nyu Starting monitored process 18 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 00:38:32,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:38:32,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:38:32,554 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 00:38:32,574 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 00:38:32,577 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 00:38:32,577 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 00:38:32,578 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 00:38:32,579 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 00:38:32,579 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 00:38:32,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:38:32,586 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 00:38:32,598 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 00:38:32,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 00:38:32,598 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 00:38:32,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 00:38:32,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 00:38:32,599 INFO L87 Difference]: Start difference. First operand 144 states and 154 transitions. Second operand 5 states. [2018-11-10 00:38:32,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 00:38:32,848 INFO L93 Difference]: Finished difference Result 151 states and 159 transitions. [2018-11-10 00:38:32,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 00:38:32,849 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2018-11-10 00:38:32,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 00:38:32,849 INFO L225 Difference]: With dead ends: 151 [2018-11-10 00:38:32,849 INFO L226 Difference]: Without dead ends: 151 [2018-11-10 00:38:32,850 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-10 00:38:32,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-11-10 00:38:32,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 143. [2018-11-10 00:38:32,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-11-10 00:38:32,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 151 transitions. [2018-11-10 00:38:32,852 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 151 transitions. Word has length 37 [2018-11-10 00:38:32,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 00:38:32,852 INFO L481 AbstractCegarLoop]: Abstraction has 143 states and 151 transitions. [2018-11-10 00:38:32,852 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 00:38:32,853 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 151 transitions. [2018-11-10 00:38:32,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-10 00:38:32,853 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 00:38:32,853 INFO L375 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] [2018-11-10 00:38:32,853 INFO L424 AbstractCegarLoop]: === Iteration 18 === [mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr62REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr50REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION]=== [2018-11-10 00:38:32,854 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:38:32,854 INFO L82 PathProgramCache]: Analyzing trace with hash 1671397198, now seen corresponding path program 1 times [2018-11-10 00:38:32,854 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 00:38:32,854 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d64cda5f-b449-499c-abc1-5cd796bc5494/bin-2019/uautomizer/cvc4nyu Starting monitored process 19 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 00:38:32,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:38:32,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:38:32,917 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 00:38:32,919 INFO L477 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 [2018-11-10 00:38:32,919 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 00:38:32,921 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 00:38:32,921 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-10 00:38:32,932 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 00:38:32,933 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 00:38:32,933 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-10 00:38:32,933 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 00:38:32,935 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 00:38:32,935 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2018-11-10 00:38:32,946 INFO L477 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 7 treesize of output 5 [2018-11-10 00:38:32,948 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-10 00:38:32,948 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 00:38:32,949 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 00:38:32,951 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 00:38:32,951 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:12, output treesize:4 [2018-11-10 00:38:32,952 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 00:38:32,952 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 00:38:32,954 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 00:38:32,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 00:38:32,954 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 00:38:32,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 00:38:32,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 00:38:32,955 INFO L87 Difference]: Start difference. First operand 143 states and 151 transitions. Second operand 6 states. [2018-11-10 00:38:33,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 00:38:33,213 INFO L93 Difference]: Finished difference Result 179 states and 187 transitions. [2018-11-10 00:38:33,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 00:38:33,214 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2018-11-10 00:38:33,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 00:38:33,215 INFO L225 Difference]: With dead ends: 179 [2018-11-10 00:38:33,215 INFO L226 Difference]: Without dead ends: 179 [2018-11-10 00:38:33,215 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-11-10 00:38:33,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-11-10 00:38:33,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 143. [2018-11-10 00:38:33,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-11-10 00:38:33,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 150 transitions. [2018-11-10 00:38:33,218 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 150 transitions. Word has length 38 [2018-11-10 00:38:33,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 00:38:33,218 INFO L481 AbstractCegarLoop]: Abstraction has 143 states and 150 transitions. [2018-11-10 00:38:33,218 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 00:38:33,218 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 150 transitions. [2018-11-10 00:38:33,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-10 00:38:33,219 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 00:38:33,219 INFO L375 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] [2018-11-10 00:38:33,219 INFO L424 AbstractCegarLoop]: === Iteration 19 === [mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr62REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr50REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION]=== [2018-11-10 00:38:33,219 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:38:33,220 INFO L82 PathProgramCache]: Analyzing trace with hash 1693981530, now seen corresponding path program 1 times [2018-11-10 00:38:33,220 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 00:38:33,220 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d64cda5f-b449-499c-abc1-5cd796bc5494/bin-2019/uautomizer/cvc4nyu Starting monitored process 20 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 00:38:33,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:38:33,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:38:33,303 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 00:38:33,314 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 00:38:33,316 INFO L477 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 10 treesize of output 9 [2018-11-10 00:38:33,316 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 00:38:33,318 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 00:38:33,321 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 00:38:33,321 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 00:38:33,329 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 00:38:33,331 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 00:38:33,331 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 00:38:33,333 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 00:38:33,338 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 00:38:33,338 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 00:38:33,344 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 00:38:33,344 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 00:38:33,346 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 00:38:33,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 00:38:33,347 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 00:38:33,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 00:38:33,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 00:38:33,347 INFO L87 Difference]: Start difference. First operand 143 states and 150 transitions. Second operand 4 states. [2018-11-10 00:38:33,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 00:38:33,496 INFO L93 Difference]: Finished difference Result 211 states and 222 transitions. [2018-11-10 00:38:33,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 00:38:33,498 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2018-11-10 00:38:33,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 00:38:33,498 INFO L225 Difference]: With dead ends: 211 [2018-11-10 00:38:33,499 INFO L226 Difference]: Without dead ends: 211 [2018-11-10 00:38:33,499 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 00:38:33,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-11-10 00:38:33,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 198. [2018-11-10 00:38:33,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-11-10 00:38:33,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 215 transitions. [2018-11-10 00:38:33,502 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 215 transitions. Word has length 44 [2018-11-10 00:38:33,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 00:38:33,502 INFO L481 AbstractCegarLoop]: Abstraction has 198 states and 215 transitions. [2018-11-10 00:38:33,502 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 00:38:33,503 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 215 transitions. [2018-11-10 00:38:33,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-10 00:38:33,503 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 00:38:33,503 INFO L375 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, 1, 1, 1, 1, 1] [2018-11-10 00:38:33,503 INFO L424 AbstractCegarLoop]: === Iteration 20 === [mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr62REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr50REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION]=== [2018-11-10 00:38:33,504 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:38:33,504 INFO L82 PathProgramCache]: Analyzing trace with hash -228076813, now seen corresponding path program 1 times [2018-11-10 00:38:33,504 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 00:38:33,504 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d64cda5f-b449-499c-abc1-5cd796bc5494/bin-2019/uautomizer/cvc4nyu Starting monitored process 21 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 00:38:33,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:38:33,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:38:33,582 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 00:38:33,598 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 00:38:33,602 INFO L477 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 10 treesize of output 9 [2018-11-10 00:38:33,602 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 00:38:33,606 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 00:38:33,619 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 00:38:33,621 INFO L477 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 10 treesize of output 9 [2018-11-10 00:38:33,622 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 00:38:33,624 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 00:38:33,632 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 00:38:33,632 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:30, output treesize:22 [2018-11-10 00:38:33,769 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-11-10 00:38:33,772 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 3 [2018-11-10 00:38:33,772 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 00:38:33,775 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 00:38:33,788 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-11-10 00:38:33,791 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 3 [2018-11-10 00:38:33,791 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 00:38:33,794 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 00:38:33,799 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 00:38:33,799 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:43, output treesize:7 [2018-11-10 00:38:33,865 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:38:33,865 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 00:38:34,013 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:38:34,015 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 00:38:34,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 16 [2018-11-10 00:38:34,015 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-10 00:38:34,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-10 00:38:34,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2018-11-10 00:38:34,016 INFO L87 Difference]: Start difference. First operand 198 states and 215 transitions. Second operand 16 states. [2018-11-10 00:38:35,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 00:38:35,659 INFO L93 Difference]: Finished difference Result 264 states and 284 transitions. [2018-11-10 00:38:35,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-10 00:38:35,660 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 47 [2018-11-10 00:38:35,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 00:38:35,660 INFO L225 Difference]: With dead ends: 264 [2018-11-10 00:38:35,661 INFO L226 Difference]: Without dead ends: 264 [2018-11-10 00:38:35,661 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=283, Invalid=907, Unknown=0, NotChecked=0, Total=1190 [2018-11-10 00:38:35,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2018-11-10 00:38:35,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 220. [2018-11-10 00:38:35,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-11-10 00:38:35,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 240 transitions. [2018-11-10 00:38:35,664 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 240 transitions. Word has length 47 [2018-11-10 00:38:35,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 00:38:35,664 INFO L481 AbstractCegarLoop]: Abstraction has 220 states and 240 transitions. [2018-11-10 00:38:35,664 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-10 00:38:35,664 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 240 transitions. [2018-11-10 00:38:35,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-10 00:38:35,665 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 00:38:35,665 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 00:38:35,665 INFO L424 AbstractCegarLoop]: === Iteration 21 === [mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr62REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr50REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION]=== [2018-11-10 00:38:35,665 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:38:35,665 INFO L82 PathProgramCache]: Analyzing trace with hash 1519552979, now seen corresponding path program 1 times [2018-11-10 00:38:35,666 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 00:38:35,666 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d64cda5f-b449-499c-abc1-5cd796bc5494/bin-2019/uautomizer/cvc4nyu Starting monitored process 22 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 00:38:35,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:38:35,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 00:38:35,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 00:38:35,872 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-10 00:38:35,888 WARN L387 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-11-10 00:38:35,904 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 12:38:35 BoogieIcfgContainer [2018-11-10 00:38:35,904 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 00:38:35,905 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 00:38:35,905 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 00:38:35,905 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 00:38:35,905 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:38:18" (3/4) ... [2018-11-10 00:38:35,908 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 00:38:35,908 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 00:38:35,909 INFO L168 Benchmark]: Toolchain (without parser) took 18814.16 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 340.3 MB). Free memory was 944.4 MB in the beginning and 979.3 MB in the end (delta: -34.9 MB). Peak memory consumption was 305.3 MB. Max. memory is 11.5 GB. [2018-11-10 00:38:35,909 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 00:38:35,909 INFO L168 Benchmark]: CACSL2BoogieTranslator took 321.37 ms. Allocated memory is still 1.0 GB. Free memory was 944.4 MB in the beginning and 922.9 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-11-10 00:38:35,910 INFO L168 Benchmark]: Boogie Preprocessor took 89.85 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 922.9 MB in the beginning and 1.1 GB in the end (delta: -212.7 MB). Peak memory consumption was 22.1 MB. Max. memory is 11.5 GB. [2018-11-10 00:38:35,910 INFO L168 Benchmark]: RCFGBuilder took 682.63 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: 72.8 MB). Peak memory consumption was 72.8 MB. Max. memory is 11.5 GB. [2018-11-10 00:38:35,910 INFO L168 Benchmark]: TraceAbstraction took 17713.47 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 191.9 MB). Free memory was 1.1 GB in the beginning and 979.3 MB in the end (delta: 83.5 MB). Peak memory consumption was 275.4 MB. Max. memory is 11.5 GB. [2018-11-10 00:38:35,910 INFO L168 Benchmark]: Witness Printer took 3.73 ms. Allocated memory is still 1.4 GB. Free memory is still 979.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 00:38:35,911 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 321.37 ms. Allocated memory is still 1.0 GB. Free memory was 944.4 MB in the beginning and 922.9 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 89.85 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 922.9 MB in the beginning and 1.1 GB in the end (delta: -212.7 MB). Peak memory consumption was 22.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 682.63 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: 72.8 MB). Peak memory consumption was 72.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 17713.47 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 191.9 MB). Free memory was 1.1 GB in the beginning and 979.3 MB in the end (delta: 83.5 MB). Peak memory consumption was 275.4 MB. Max. memory is 11.5 GB. * Witness Printer took 3.73 ms. Allocated memory is still 1.4 GB. Free memory is still 979.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 985]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 985. Possible FailurePath: [L987] EXPR, FCALL malloc(sizeof(struct TSLL)) VAL [malloc(sizeof(struct TSLL))={1:0}] [L987] struct TSLL* null = malloc(sizeof(struct TSLL)); VAL [malloc(sizeof(struct TSLL))={1:0}, null={1:0}] [L988] FCALL null->next = ((void*)0) VAL [malloc(sizeof(struct TSLL))={1:0}, null={1:0}] [L989] FCALL null->prev = ((void*)0) VAL [malloc(sizeof(struct TSLL))={1:0}, null={1:0}] [L990] FCALL null->colour = BLACK VAL [malloc(sizeof(struct TSLL))={1:0}, null={1:0}] [L992] EXPR, FCALL malloc(sizeof(struct TSLL)) VAL [malloc(sizeof(struct TSLL))={-2:0}, malloc(sizeof(struct TSLL))={1:0}, null={1:0}] [L992] struct TSLL* list = malloc(sizeof(struct TSLL)); VAL [list={-2:0}, malloc(sizeof(struct TSLL))={-2:0}, malloc(sizeof(struct TSLL))={1:0}, null={1:0}] [L993] FCALL list->next = null VAL [list={-2:0}, malloc(sizeof(struct TSLL))={-2:0}, malloc(sizeof(struct TSLL))={1:0}, null={1:0}] [L994] FCALL list->prev = null VAL [list={-2:0}, malloc(sizeof(struct TSLL))={-2:0}, malloc(sizeof(struct TSLL))={1:0}, null={1:0}] [L995] FCALL list->colour = BLACK VAL [list={-2:0}, malloc(sizeof(struct TSLL))={-2:0}, malloc(sizeof(struct TSLL))={1:0}, null={1:0}] [L997] struct TSLL* end = list; VAL [end={-2:0}, list={-2:0}, malloc(sizeof(struct TSLL))={-2:0}, malloc(sizeof(struct TSLL))={1:0}, null={1:0}] [L1000] COND FALSE !(__VERIFIER_nondet_int()) [L1026] end = null [L1027] end = list VAL [end={-2:0}, list={-2:0}, malloc(sizeof(struct TSLL))={-2:0}, malloc(sizeof(struct TSLL))={1:0}, null={1:0}] [L1030] COND FALSE !(!(null != end)) VAL [end={-2:0}, list={-2:0}, malloc(sizeof(struct TSLL))={-2:0}, malloc(sizeof(struct TSLL))={1:0}, null={1:0}] [L1030] COND FALSE !(0) VAL [end={-2:0}, list={-2:0}, malloc(sizeof(struct TSLL))={-2:0}, malloc(sizeof(struct TSLL))={1:0}, null={1:0}] [L1031] EXPR, FCALL end->colour VAL [end={-2:0}, end->colour=1, list={-2:0}, malloc(sizeof(struct TSLL))={-2:0}, malloc(sizeof(struct TSLL))={1:0}, null={1:0}] [L1031] COND FALSE !(!(BLACK == end->colour)) [L1031] COND FALSE !(0) VAL [end={-2:0}, list={-2:0}, malloc(sizeof(struct TSLL))={-2:0}, malloc(sizeof(struct TSLL))={1:0}, null={1:0}] [L1032] COND TRUE null != end VAL [end={-2:0}, list={-2:0}, malloc(sizeof(struct TSLL))={-2:0}, malloc(sizeof(struct TSLL))={1:0}, null={1:0}] [L1034] EXPR, FCALL end->colour VAL [end={-2:0}, end->colour=1, list={-2:0}, malloc(sizeof(struct TSLL))={-2:0}, malloc(sizeof(struct TSLL))={1:0}, null={1:0}] [L1034] COND FALSE !(RED == end->colour) [L1041] EXPR, FCALL end->next VAL [end={-2:0}, end->next={1:0}, list={-2:0}, malloc(sizeof(struct TSLL))={-2:0}, malloc(sizeof(struct TSLL))={1:0}, null={1:0}] [L1041] end = end->next [L1032] COND FALSE !(null != end) VAL [end={1:0}, list={-2:0}, malloc(sizeof(struct TSLL))={-2:0}, malloc(sizeof(struct TSLL))={1:0}, null={1:0}] [L1045] COND TRUE null != list VAL [end={1:0}, list={-2:0}, malloc(sizeof(struct TSLL))={-2:0}, malloc(sizeof(struct TSLL))={1:0}, null={1:0}] [L1047] EXPR, FCALL list->colour VAL [end={1:0}, list={-2:0}, list->colour=1, malloc(sizeof(struct TSLL))={-2:0}, malloc(sizeof(struct TSLL))={1:0}, null={1:0}] [L1047] COND FALSE !(RED == list->colour) [L1056] EXPR, FCALL list->next VAL [end={1:0}, list={-2:0}, list->next={1:0}, malloc(sizeof(struct TSLL))={-2:0}, malloc(sizeof(struct TSLL))={1:0}, null={1:0}] [L1056] end = list->next [L1057] free(list) VAL [end={1:0}, list={-2:0}, malloc(sizeof(struct TSLL))={-2:0}, malloc(sizeof(struct TSLL))={1:0}, null={1:0}] [L1057] free(list) VAL [end={1:0}, list={-2:0}, malloc(sizeof(struct TSLL))={-2:0}, malloc(sizeof(struct TSLL))={1:0}, null={1:0}] [L1057] FCALL free(list) VAL [end={1:0}, list={-2:0}, malloc(sizeof(struct TSLL))={-2:0}, malloc(sizeof(struct TSLL))={1:0}, null={1:0}] [L1058] list = end VAL [end={1:0}, list={1:0}, malloc(sizeof(struct TSLL))={-2:0}, malloc(sizeof(struct TSLL))={1:0}, null={1:0}] [L1045] COND FALSE !(null != list) VAL [end={1:0}, list={1:0}, malloc(sizeof(struct TSLL))={-2:0}, malloc(sizeof(struct TSLL))={1:0}, null={1:0}] [L1062] return 0; VAL [\result=0, end={1:0}, list={1:0}, malloc(sizeof(struct TSLL))={-2:0}, malloc(sizeof(struct TSLL))={1:0}, null={1:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 164 locations, 67 error locations. UNSAFE Result, 17.6s OverallTime, 21 OverallIterations, 2 TraceHistogramMax, 12.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2010 SDtfs, 5273 SDslu, 4224 SDs, 0 SdLazy, 5433 SolverSat, 367 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 725 GetRequests, 502 SyntacticMatches, 6 SemanticMatches, 217 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 707 ImplicationChecksByTransitivity, 5.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=220occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 20 MinimizatonAttempts, 711 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 595 NumberOfCodeBlocks, 595 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 607 ConstructedInterpolants, 27 QuantifiedInterpolants, 170100 SizeOfPredicates, 133 NumberOfNonLiveVariables, 2036 ConjunctsInSsa, 176 ConjunctsInUnsatCore, 22 InterpolantComputations, 18 PerfectInterpolantSequences, 8/20 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...